/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/bb4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:39,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:39,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:39,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:39,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:39,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:39,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:39,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:39,862 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:39,862 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:39,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:39,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:39,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:39,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:39,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:39,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:39,865 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:39,865 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:40,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:40,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:40,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:40,100 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:40,102 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:40,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb4.c.bpl [2025-02-17 22:48:40,103 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb4.c.bpl' [2025-02-17 22:48:40,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:40,114 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:40,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:40,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:40,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:40,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,130 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:40,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:40,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:40,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:40,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:40,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:40,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:40,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:40,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:40,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:40,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:40,193 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:40,193 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:40,193 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:40,228 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:40,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:40,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:40,285 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:40,294 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:40,294 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:40,294 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:40 BoogieIcfgContainer [2025-02-17 22:48:40,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:40,295 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:40,295 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:40,298 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:40,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:40,299 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/2) ... [2025-02-17 22:48:40,300 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31469c45 and model type bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:40, skipping insertion in model container [2025-02-17 22:48:40,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:40,300 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:40" (2/2) ... [2025-02-17 22:48:40,301 INFO L363 chiAutomizerObserver]: Analyzing ICFG bb4.c.bpl [2025-02-17 22:48:40,343 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:40,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 62 flow [2025-02-17 22:48:40,397 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2025-02-17 22:48:40,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 4/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-17 22:48:40,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 62 flow [2025-02-17 22:48:40,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 52 flow [2025-02-17 22:48:40,414 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:40,598 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:40,598 INFO L101 AmpleReduction]: Number of pruned transitions: 7, Number of non-trivial ample sets: 23 [2025-02-17 22:48:40,598 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 20 [2025-02-17 22:48:40,603 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:40,603 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:40,603 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:40,604 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:40,604 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:40,604 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:40,604 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:40,604 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:40,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:40,614 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-02-17 22:48:40,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:40,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:40,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:40,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:40,616 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:40,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:40,618 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-02-17 22:48:40,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:40,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:40,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:40,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:40,622 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:40,622 INFO L754 eck$LassoCheckResult]: Loop: "[55] L22-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[58] L24-->L22: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2581, now seen corresponding path program 1 times [2025-02-17 22:48:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306251888] [2025-02-17 22:48:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:40,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:40,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:40,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:40,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-02-17 22:48:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026546560] [2025-02-17 22:48:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:40,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:40,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:40,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2482104, now seen corresponding path program 1 times [2025-02-17 22:48:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383008] [2025-02-17 22:48:40,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:40,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:40,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:40,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:40,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:40,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:40,753 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:40,754 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:40,754 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:40,754 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:40,754 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:40,754 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,754 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:40,754 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:40,754 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:40,754 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:40,755 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:40,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:40,799 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:40,799 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:40,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:40,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:40,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:40,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:40,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:40,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:48:40,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:40,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:40,905 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:40,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:40,910 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:40,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:40,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:40,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:40,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:40,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:40,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:40,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:40,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:40,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:40,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:40,940 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:40,943 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:40,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:40,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:40,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:40,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:40,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:40,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:40,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:40,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:40,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:40,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:40,975 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:40,975 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:40,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:48:40,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:40,983 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:40,984 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:40,984 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:40,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:40,993 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:41,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:41,129 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:41,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 181 states and 395 transitions. Complement of second has 7 states. [2025-02-17 22:48:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-02-17 22:48:41,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:48:41,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:48:41,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:48:41,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 395 transitions. [2025-02-17 22:48:41,266 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-02-17 22:48:41,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 92 states and 219 transitions. [2025-02-17 22:48:41,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-17 22:48:41,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-17 22:48:41,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 219 transitions. [2025-02-17 22:48:41,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:41,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 219 transitions. [2025-02-17 22:48:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 219 transitions. [2025-02-17 22:48:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2025-02-17 22:48:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.445945945945946) internal successors, (181), 73 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 181 transitions. [2025-02-17 22:48:41,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 181 transitions. [2025-02-17 22:48:41,291 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 181 transitions. [2025-02-17 22:48:41,291 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:41,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 181 transitions. [2025-02-17 22:48:41,293 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 26 [2025-02-17 22:48:41,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:41,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:41,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:41,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:41,293 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L22-->L26-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:41,293 INFO L754 eck$LassoCheckResult]: Loop: "[57] L26-1-->L28: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[60] L28-->L26-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 80065, now seen corresponding path program 1 times [2025-02-17 22:48:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650982864] [2025-02-17 22:48:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2788, now seen corresponding path program 1 times [2025-02-17 22:48:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974291815] [2025-02-17 22:48:41,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 76944292, now seen corresponding path program 1 times [2025-02-17 22:48:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937336360] [2025-02-17 22:48:41,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,323 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,323 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:41,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:41,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,323 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,340 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,340 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:48:41,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:41,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:48:41,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:48:41,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:41,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,446 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:41,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:48:41,450 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,451 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:41,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:41,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,451 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,469 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:48:41,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:41,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:41,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:41,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:41,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:41,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:41,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:41,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:41,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:41,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:41,494 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:41,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:48:41,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:41,504 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:41,504 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:41,504 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:48:41,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:41,510 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:41,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:41,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:41,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 181 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 181 transitions. cyclomatic complexity: 128. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 196 states and 448 transitions. Complement of second has 7 states. [2025-02-17 22:48:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-02-17 22:48:41,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:41,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:41,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:41,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 448 transitions. [2025-02-17 22:48:41,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-17 22:48:41,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 16 states and 35 transitions. [2025-02-17 22:48:41,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-17 22:48:41,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-17 22:48:41,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 35 transitions. [2025-02-17 22:48:41,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:41,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-02-17 22:48:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 35 transitions. [2025-02-17 22:48:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-17 22:48:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2025-02-17 22:48:41,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-02-17 22:48:41,612 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 35 transitions. [2025-02-17 22:48:41,612 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:41,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 35 transitions. [2025-02-17 22:48:41,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-17 22:48:41,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:41,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:41,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:41,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:41,613 INFO L752 eck$LassoCheckResult]: Stem: "[50] $Ultimate##0-->L13: Formula: (= v_x2_1 0) InVars {} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L13-1-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:48:41,613 INFO L754 eck$LassoCheckResult]: Loop: "[62] L35-->L37: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[65] L37-->L35: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 80084, now seen corresponding path program 1 times [2025-02-17 22:48:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831703190] [2025-02-17 22:48:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2948, now seen corresponding path program 1 times [2025-02-17 22:48:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043166845] [2025-02-17 22:48:41,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash 76962711, now seen corresponding path program 1 times [2025-02-17 22:48:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492567593] [2025-02-17 22:48:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,642 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,644 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,644 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,644 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:41,644 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,644 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,644 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:41,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,644 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,670 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,670 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:41,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:48:41,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:41,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:41,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,694 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:48:41,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:41,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,760 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:41,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:48:41,764 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,764 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:41,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,765 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,765 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,765 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:41,765 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,765 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,784 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,784 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:41,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:48:41,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:41,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:41,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:41,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:41,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:41,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:41,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:41,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:41,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:41,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:41,819 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:41,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:48:41,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:41,824 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:41,824 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:41,824 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:48:41,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:48:41,832 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:41,892 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:41,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 35 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 69 transitions. Complement of second has 6 states. [2025-02-17 22:48:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-02-17 22:48:41,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:41,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:41,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:41,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 69 transitions. [2025-02-17 22:48:41,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:41,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:41,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:41,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:41,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:41,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:41,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:41,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:41,923 INFO L201 PluginConnector]: Adding new model bb4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:41 BoogieIcfgContainer [2025-02-17 22:48:41,924 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:41,924 INFO L158 Benchmark]: Toolchain (without parser) took 1809.83ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.8MB in the beginning and 70.8MB in the end (delta: 15.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2025-02-17 22:48:41,924 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.5MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:41,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.63ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:41,925 INFO L158 Benchmark]: Boogie Preprocessor took 9.53ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.8MB in the end (delta: 640.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:41,925 INFO L158 Benchmark]: RCFGBuilder took 152.65ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 75.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:41,925 INFO L158 Benchmark]: BuchiAutomizer took 1628.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2025-02-17 22:48:41,926 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 86.5MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.63ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.53ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.8MB in the end (delta: 640.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 152.65ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 75.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1628.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 31 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 235, Trivial Ample Sets caused by loops: 20, Number of non-trivial ample sets: 23, Number of pruned transitions: 7, Number of transitions in reduction automaton: 107, Number of states in reduction automaton: 52, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:41,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:42,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:42,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...