./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-178.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:49,265 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:49,339 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b13968d1-396e-44fc-9be7-01cb6c7bf563/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:49,344 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:49,345 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:49,370 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:49,370 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:49,371 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:49,371 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:49,371 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:49,372 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:49,372 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:49,372 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:49,372 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:49,372 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:49,372 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:49,373 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:49,373 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:49,374 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:49,374 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:49,374 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:49,375 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:49,710 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:49,721 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:49,724 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:49,727 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:49,727 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:49,729 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b13968d1-396e-44fc-9be7-01cb6c7bf563/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-178.smt2
[2025-04-28 21:21:49,730 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:49,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:49,953 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b13968d1-396e-44fc-9be7-01cb6c7bf563/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-178.smt2
[2025-04-28 21:21:49,960 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:49,963 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:49,966 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:49,966 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:49,966 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:49,969 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:50,002 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50 Unit
[2025-04-28 21:21:50,003 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:50,005 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:50,006 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:50,006 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:50,024 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,024 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,059 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,060 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,064 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,065 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,068 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,069 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,069 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,087 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:50,088 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:50,088 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:50,088 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:50,091 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,093 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:50,105 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:50,119 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:50,123 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:50,134 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:50,134 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:50,134 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:50,134 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main given in one single declaration
[2025-04-28 21:21:50,134 INFO  L130     BoogieDeclarations]: Found specification of procedure %main
[2025-04-28 21:21:50,134 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main
[2025-04-28 21:21:50,135 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.2 given in one single declaration
[2025-04-28 21:21:50,135 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.2
[2025-04-28 21:21:50,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.2
[2025-04-28 21:21:50,135 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.5 given in one single declaration
[2025-04-28 21:21:50,135 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.5
[2025-04-28 21:21:50,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.5
[2025-04-28 21:21:50,135 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.9 given in one single declaration
[2025-04-28 21:21:50,135 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.9
[2025-04-28 21:21:50,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.9
[2025-04-28 21:21:50,135 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure %main.3 given in one single declaration
[2025-04-28 21:21:50,135 INFO  L130     BoogieDeclarations]: Found specification of procedure %main.3
[2025-04-28 21:21:50,135 INFO  L138     BoogieDeclarations]: Found implementation of procedure %main.3
[2025-04-28 21:21:50,136 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:50,136 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:50,136 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:50,189 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:50,191 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:50,319 INFO  L?                        ?]: Removed 4 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:50,319 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:50,338 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:50,339 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:50,340 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50 BoogieIcfgContainer
[2025-04-28 21:21:50,340 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:50,345 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:50,345 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:50,350 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:50,351 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/3) ...
[2025-04-28 21:21:50,351 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e672b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,352 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (2/3) ...
[2025-04-28 21:21:50,352 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e672b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,353 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50" (3/3) ...
[2025-04-28 21:21:50,354 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:50,371 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:50,373 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 7 procedures, 31 locations, 46 edges, 7 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:50,426 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:50,440 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b3fddcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:50,440 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:50,444 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 31 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9)
[2025-04-28 21:21:50,453 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:50,453 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,454 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,455 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,461 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -1172399910, now seen corresponding path program 1 times
[2025-04-28 21:21:50,471 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,471 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103645256]
[2025-04-28 21:21:50,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:50,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:50,525 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,525 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:50,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,697 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103645256]
[2025-04-28 21:21:50,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103645256] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:50,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637105020]
[2025-04-28 21:21:50,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,710 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:50,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,748 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:50,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:50,751 INFO  L87              Difference]: Start difference. First operand  has 31 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand  has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:50,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,843 INFO  L93              Difference]: Finished difference Result 35 states and 42 transitions.
[2025-04-28 21:21:50,845 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:50,847 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 17
[2025-04-28 21:21:50,847 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,855 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:50,856 INFO  L226             Difference]: Without dead ends: 33
[2025-04-28 21:21:50,858 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:50,861 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,863 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:50,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2025-04-28 21:21:50,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2025-04-28 21:21:50,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 19 states have internal predecessors, (19), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12)
[2025-04-28 21:21:50,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions.
[2025-04-28 21:21:50,928 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 17
[2025-04-28 21:21:50,928 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,929 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 40 transitions.
[2025-04-28 21:21:50,929 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:50,929 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions.
[2025-04-28 21:21:50,931 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:50,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,931 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,931 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:50,931 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,932 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,932 INFO  L85        PathProgramCache]: Analyzing trace with hash -779372900, now seen corresponding path program 1 times
[2025-04-28 21:21:50,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,933 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581377922]
[2025-04-28 21:21:50,933 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:50,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:50,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:51,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,230 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581377922]
[2025-04-28 21:21:51,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581377922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:51,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207875192]
[2025-04-28 21:21:51,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,231 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:51,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:51,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:51,235 INFO  L87              Difference]: Start difference. First operand 33 states and 40 transitions. Second operand  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:51,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,344 INFO  L93              Difference]: Finished difference Result 35 states and 43 transitions.
[2025-04-28 21:21:51,345 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:51,345 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-04-28 21:21:51,347 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,347 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:51,348 INFO  L226             Difference]: Without dead ends: 35
[2025-04-28 21:21:51,348 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:51,349 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,349 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2025-04-28 21:21:51,355 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31.
[2025-04-28 21:21:51,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 17 states have internal predecessors, (18), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11)
[2025-04-28 21:21:51,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions.
[2025-04-28 21:21:51,357 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17
[2025-04-28 21:21:51,357 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,357 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 38 transitions.
[2025-04-28 21:21:51,357 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:51,357 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions.
[2025-04-28 21:21:51,358 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:51,358 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,359 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,359 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:51,359 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,360 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821392294, now seen corresponding path program 1 times
[2025-04-28 21:21:51,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,360 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201826678]
[2025-04-28 21:21:51,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:51,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:51,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:51,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,675 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201826678]
[2025-04-28 21:21:51,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201826678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:51,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428785722]
[2025-04-28 21:21:51,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,676 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:51,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:51,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:51,677 INFO  L87              Difference]: Start difference. First operand 31 states and 38 transitions. Second operand  has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,805 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,806 INFO  L93              Difference]: Finished difference Result 43 states and 53 transitions.
[2025-04-28 21:21:51,811 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:51,812 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 29
[2025-04-28 21:21:51,812 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,813 INFO  L225             Difference]: With dead ends: 43
[2025-04-28 21:21:51,813 INFO  L226             Difference]: Without dead ends: 31
[2025-04-28 21:21:51,813 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:51,816 INFO  L437           NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,816 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2025-04-28 21:21:51,824 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2025-04-28 21:21:51,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 17 states have internal predecessors, (17), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11)
[2025-04-28 21:21:51,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions.
[2025-04-28 21:21:51,828 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 29
[2025-04-28 21:21:51,829 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,829 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 37 transitions.
[2025-04-28 21:21:51,830 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,830 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions.
[2025-04-28 21:21:51,832 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:51,844 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,844 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,845 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:51,845 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,848 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 185209669, now seen corresponding path program 1 times
[2025-04-28 21:21:51,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,849 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377454187]
[2025-04-28 21:21:51,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:51,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:51,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:52,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,082 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377454187]
[2025-04-28 21:21:52,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377454187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:52,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:52,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387377761]
[2025-04-28 21:21:52,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,083 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:52,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,083 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:52,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:52,084 INFO  L87              Difference]: Start difference. First operand 31 states and 37 transitions. Second operand  has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:52,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,158 INFO  L93              Difference]: Finished difference Result 37 states and 45 transitions.
[2025-04-28 21:21:52,159 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:52,160 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29
[2025-04-28 21:21:52,160 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,161 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:52,161 INFO  L226             Difference]: Without dead ends: 37
[2025-04-28 21:21:52,161 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:52,162 INFO  L437           NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,162 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:52,166 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2025-04-28 21:21:52,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35.
[2025-04-28 21:21:52,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 16 states have (on average 1.1875) internal successors, (19), 19 states have internal predecessors, (19), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:52,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions.
[2025-04-28 21:21:52,175 INFO  L79                 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 29
[2025-04-28 21:21:52,175 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,175 INFO  L485      AbstractCegarLoop]: Abstraction has 35 states and 42 transitions.
[2025-04-28 21:21:52,175 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2025-04-28 21:21:52,176 INFO  L278                IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions.
[2025-04-28 21:21:52,178 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:52,178 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,179 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:52,179 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:52,179 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,180 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -1452506648, now seen corresponding path program 1 times
[2025-04-28 21:21:52,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,180 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057762905]
[2025-04-28 21:21:52,180 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,192 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:52,203 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:52,203 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,203 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:52,203 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:52,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:52,216 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:52,216 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,216 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:52,243 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:52,244 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:52,245 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:52,247 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:52,252 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-04-28 21:21:52,274 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:52,279 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:52 BoogieIcfgContainer
[2025-04-28 21:21:52,279 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:52,282 INFO  L158              Benchmark]: Toolchain (without parser) took 2316.59ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 164.7MB in the beginning and 106.4MB in the end (delta: 58.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,283 INFO  L158              Benchmark]: SmtParser took 0.41ms. Allocated memory is still 234.9MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,283 INFO  L158              Benchmark]: ChcToBoogie took 38.29ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 163.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,283 INFO  L158              Benchmark]: Boogie Preprocessor took 82.05ms. Allocated memory is still 234.9MB. Free memory was 163.6MB in the beginning and 161.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,284 INFO  L158              Benchmark]: RCFGBuilder took 252.53ms. Allocated memory is still 234.9MB. Free memory was 161.6MB in the beginning and 152.2MB in the end (delta: 9.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,284 INFO  L158              Benchmark]: TraceAbstraction took 1934.11ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.8MB in the beginning and 106.4MB in the end (delta: 45.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:52,287 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.41ms. Allocated memory is still 234.9MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 38.29ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 163.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 82.05ms. Allocated memory is still 234.9MB. Free memory was 163.6MB in the beginning and 161.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 252.53ms. Allocated memory is still 234.9MB. Free memory was 161.6MB in the beginning and 152.2MB in the end (delta: 9.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * TraceAbstraction took 1934.11ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.8MB in the beginning and 106.4MB in the end (delta: 45.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Unknown line] : the set of constraint Horn clauses is unsatisfiable
    the set of constraint Horn clauses is unsatisfiable
We found a FailurePath: 
[L0]  CALL  call False();
[L0]        assume !!hbv_False_v_0_1;
      VAL   [hbv_False_v_0_1=true]
[L0]  CALL  call %main(hbv_False_v_0_1);
      VAL   [hhv_%main_A_0=true]
[L0]        assume hbv_%main_v_2_1 == 1 && hbv_%main_v_3_2 == 1;
      VAL   [hbv_%main_v_2_1=1, hbv_%main_v_3_2=1, hhv_%main_A_0=true]
[L0]  CALL  call %main.2(hbv_%main_v_2_1, hbv_%main_v_3_2, hbv_%main_B_3, hhv_%main_A_0);
      VAL   [hhv_%main.2_B_0=1, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=true]
[L0]        assume !!hhv_%main.2_v_4_2 && !!hbv_%main.2_A_1;
      VAL   [hbv_%main.2_A_1=true, hhv_%main.2_B_0=1, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=true]
[L0]  CALL  call %main.5(hhv_%main.2_B_0, hhv_%main.2_C_1, hbv_%main.2_A_1, hbv_%main.2_D_2, hhv_%main.2_D_3);
      VAL   [hhv_%main.5_A_0=1, hhv_%main.5_B_1=1, hhv_%main.5_C_2=true, hhv_%main.5_D_4=true, hhv_%main.5_v_5_3=false]
[L0]        assume !hhv_%main.5_v_5_3;
      VAL   [hhv_%main.5_A_0=1, hhv_%main.5_B_1=1, hhv_%main.5_C_2=true, hhv_%main.5_D_4=true, hhv_%main.5_v_5_3=false]
[L0]  CALL  call %main.9(hhv_%main.5_A_0, hhv_%main.5_B_1, hhv_%main.5_C_2, hbv_%main.5_E_1, hhv_%main.5_D_4);
      VAL   [hhv_%main.9_A_0=1, hhv_%main.9_B_1=1, hhv_%main.9_D_4=true, hhv_%main.9_v_5_3=true]
[L0]        assume !!hhv_%main.9_v_5_3 && hhv_%main.9_A_0 + 1 == hbv_%main.9_A_1;
      VAL   [hbv_%main.9_A_1=2, hhv_%main.9_A_0=1, hhv_%main.9_B_1=1, hhv_%main.9_D_4=true, hhv_%main.9_v_5_3=true]
[L0]  CALL  call %main.2(hbv_%main.9_A_1, hhv_%main.9_B_1, hbv_%main.9_F_2, hhv_%main.9_D_4);
      VAL   [hhv_%main.2_B_0=2, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=false]
[L0]        assume (!(!hbv_%main.2_A_1 && hhv_%main.2_C_1 != hhv_%main.2_B_0) && !(hhv_%main.2_C_1 == hhv_%main.2_B_0 && hbv_%main.2_A_1)) && !hhv_%main.2_v_4_2;
      VAL   [hbv_%main.2_A_1=true, hhv_%main.2_B_0=2, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=false]
[L0]  CALL  call %main.3(hhv_%main.2_B_0, hhv_%main.2_C_1, hbv_%main.2_A_1, hhv_%main.2_D_3);
      VAL   [hhv_%main.3_C_3=true, hhv_%main.3_v_3_2=true]
[L0]        assume !!hhv_%main.3_C_3 && !!hhv_%main.3_v_3_2;
      VAL   [hhv_%main.3_C_3=true, hhv_%main.3_v_3_2=true]
[L0]  RET   call %main.3(hhv_%main.2_B_0, hhv_%main.2_C_1, hbv_%main.2_A_1, hhv_%main.2_D_3);
      VAL   [hbv_%main.2_A_1=true, hhv_%main.2_B_0=2, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=false]
[L0]  RET   call %main.2(hbv_%main.9_A_1, hhv_%main.9_B_1, hbv_%main.9_F_2, hhv_%main.9_D_4);
      VAL   [hbv_%main.9_A_1=2, hbv_%main.9_F_2=false, hhv_%main.9_A_0=1, hhv_%main.9_B_1=1, hhv_%main.9_D_4=true, hhv_%main.9_v_5_3=true]
[L0]  RET   call %main.9(hhv_%main.5_A_0, hhv_%main.5_B_1, hhv_%main.5_C_2, hbv_%main.5_E_1, hhv_%main.5_D_4);
      VAL   [hbv_%main.5_E_1=true, hhv_%main.5_A_0=1, hhv_%main.5_B_1=1, hhv_%main.5_C_2=true, hhv_%main.5_D_4=true, hhv_%main.5_v_5_3=false]
[L0]  RET   call %main.5(hhv_%main.2_B_0, hhv_%main.2_C_1, hbv_%main.2_A_1, hbv_%main.2_D_2, hhv_%main.2_D_3);
      VAL   [hbv_%main.2_A_1=true, hbv_%main.2_D_2=false, hhv_%main.2_B_0=1, hhv_%main.2_C_1=1, hhv_%main.2_D_3=true, hhv_%main.2_v_4_2=true]
[L0]  RET   call %main.2(hbv_%main_v_2_1, hbv_%main_v_3_2, hbv_%main_B_3, hhv_%main_A_0);
      VAL   [hbv_%main_B_3=true, hbv_%main_v_2_1=1, hbv_%main_v_3_2=1, hhv_%main_A_0=true]
[L0]  RET   call %main(hbv_False_v_0_1);
      VAL   [hbv_False_v_0_1=true]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 7 procedures, 31 locations, 46 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 629 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 505 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 124 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-04-28 21:21:52,309 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
