/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/3_thr/mixed_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:04,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:04,655 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:49:04,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:04,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:04,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:04,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:04,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:04,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:04,680 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:04,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:04,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:04,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:04,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:04,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:04,682 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:04,682 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:49:04,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:04,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:04,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:04,917 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:04,917 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:04,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/mixed_3.c.bpl [2025-02-17 22:49:04,918 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/mixed_3.c.bpl' [2025-02-17 22:49:04,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:04,932 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:04,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:04,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:04,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,948 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:04,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:04,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:04,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:04,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:04,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:04,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:04,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:04,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/1) ... [2025-02-17 22:49:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:04,988 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:49:04,992 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:49:05,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:05,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:05,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:05,013 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:05,013 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:49:05,047 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:05,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:05,106 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:05,107 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:05,115 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:05,116 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:05,116 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:05 BoogieIcfgContainer [2025-02-17 22:49:05,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:05,117 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:05,117 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:05,122 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:05,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:05,123 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:04" (1/2) ... [2025-02-17 22:49:05,124 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600fbc84 and model type mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:05, skipping insertion in model container [2025-02-17 22:49:05,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:05,124 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:05" (2/2) ... [2025-02-17 22:49:05,125 INFO L363 chiAutomizerObserver]: Analyzing ICFG mixed_3.c.bpl [2025-02-17 22:49:05,166 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:49:05,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:49:05,219 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-17 22:49:05,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:49:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2025-02-17 22:49:05,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:49:05,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-02-17 22:49:05,238 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:05,464 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:05,465 INFO L101 AmpleReduction]: Number of pruned transitions: 133, Number of non-trivial ample sets: 201 [2025-02-17 22:49:05,465 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 251 [2025-02-17 22:49:05,472 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:05,472 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:05,472 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:05,473 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:05,473 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:05,473 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:05,473 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:05,473 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:05,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 190 states, 189 states have (on average 2.6296296296296298) internal successors, (497), 189 states have internal predecessors, (497), 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:49:05,492 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 143 [2025-02-17 22:49:05,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:05,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,499 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:05,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 190 states, 189 states have (on average 2.6296296296296298) internal successors, (497), 189 states have internal predecessors, (497), 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:49:05,506 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 143 [2025-02-17 22:49:05,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:05,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:05,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:05,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:05,515 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:05,515 INFO L754 eck$LassoCheckResult]: Loop: "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[82] L29-->L29-2: Formula: (= v_x_3 (+ v_tx_2 v_x_2 1)) InVars {tx=v_tx_2, x=v_x_3} OutVars{tx=v_tx_2, x=v_x_2} AuxVars[] AssignedVars[x]" [2025-02-17 22:49:05,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2025-02-17 22:49:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253681320] [2025-02-17 22:49:05,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-02-17 22:49:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394532211] [2025-02-17 22:49:05,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 4009932, now seen corresponding path program 1 times [2025-02-17 22:49:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210334044] [2025-02-17 22:49:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:05,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:05,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:05,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:05,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:05,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:05,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:05,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:05,706 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,707 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,707 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,707 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:05,707 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,707 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,707 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,707 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:49:05,707 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,707 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,770 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:05,770 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,776 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:49:05,777 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:49:05,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:05,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:49:05,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:05,801 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:49:05,802 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:49:05,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:05,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:05,939 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:05,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:49:05,946 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:05,946 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:05,946 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:05,946 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:05,946 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:05,946 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:05,946 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:05,946 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:05,946 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:49:05,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:05,946 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:05,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:05,995 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,018 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,021 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:49:06,023 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:49:06,024 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:49:06,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:06,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:06,054 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,065 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:49:06,066 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-02-17 22:49:06,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,070 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:49:06,077 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:49:06,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,092 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:49:06,093 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,093 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y1) = 2*x - 2*y1 + 1 Supporting invariants [1*tx >= 0] [2025-02-17 22:49:06,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:49:06,109 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:49:06,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:49:06,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:06,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:49:06,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:06,239 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:49:06,256 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:49:06,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 190 states, 189 states have (on average 2.6296296296296298) internal successors, (497), 189 states have internal predecessors, (497), 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:49:06,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 190 states, 189 states have (on average 2.6296296296296298) internal successors, (497), 189 states have internal predecessors, (497), 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 494 states and 1335 transitions. Complement of second has 6 states. [2025-02-17 22:49:06,370 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:49:06,375 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:49:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-17 22:49:06,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:06,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:06,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:06,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:06,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 1335 transitions. [2025-02-17 22:49:06,393 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 89 [2025-02-17 22:49:06,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 311 states and 868 transitions. [2025-02-17 22:49:06,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-02-17 22:49:06,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2025-02-17 22:49:06,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 868 transitions. [2025-02-17 22:49:06,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:06,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 311 states and 868 transitions. [2025-02-17 22:49:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 868 transitions. [2025-02-17 22:49:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 241. [2025-02-17 22:49:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 241 states have (on average 2.921161825726141) internal successors, (704), 240 states have internal predecessors, (704), 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:49:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 704 transitions. [2025-02-17 22:49:06,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 704 transitions. [2025-02-17 22:49:06,438 INFO L432 stractBuchiCegarLoop]: Abstraction has 241 states and 704 transitions. [2025-02-17 22:49:06,438 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:06,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 704 transitions. [2025-02-17 22:49:06,440 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 89 [2025-02-17 22:49:06,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:06,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:06,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:06,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:06,441 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-02-17 22:49:06,441 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -800050754, now seen corresponding path program 1 times [2025-02-17 22:49:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808802322] [2025-02-17 22:49:06,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:06,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:06,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:06,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash 118234, now seen corresponding path program 1 times [2025-02-17 22:49:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132494534] [2025-02-17 22:49:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:06,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:06,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:06,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:06,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1538398467, now seen corresponding path program 1 times [2025-02-17 22:49:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:06,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632952843] [2025-02-17 22:49:06,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:06,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:06,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:06,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:06,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:06,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:06,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:06,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:06,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:06,523 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,523 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,523 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,523 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,523 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:06,523 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,523 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,523 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,523 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:49:06,523 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,523 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,594 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,594 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:06,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,596 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:49:06,598 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:49:06,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,616 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:06,616 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {tx=0} Honda state: {tx=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:06,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:06,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,626 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:49:06,630 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:49:06,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,647 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:06,647 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {y1=1, x=0} Honda state: {y1=1, x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:06,653 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:49:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,655 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:49:06,656 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:49:06,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:06,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,673 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:49:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,675 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:49:06,676 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:49:06,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:06,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:06,823 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:06,830 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:49:06,830 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:06,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:06,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:06,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:06,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:06,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:06,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:06,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:49:06,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:06,830 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:06,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:06,902 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:06,902 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:06,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,905 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:49:06,906 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:49:06,907 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:49:06,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:06,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:06,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:06,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:06,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,933 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:49:06,934 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:49:06,935 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:49:06,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:06,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:06,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:06,955 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:49:06,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,957 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:49:06,959 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:49:06,961 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:49:06,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:06,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:06,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:06,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:06,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:06,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:06,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:06,982 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:49:06,982 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,984 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:49:06,986 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:49:06,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:06,998 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:49:06,998 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:06,998 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:49:07,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,006 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:49:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:07,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:07,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:07,076 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:49:07,077 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:49:07,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 704 transitions. cyclomatic complexity: 506 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:07,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 704 transitions. cyclomatic complexity: 506. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 939 states and 2820 transitions. Complement of second has 7 states. [2025-02-17 22:49:07,161 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:49:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:49:07,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:49:07,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 10 letters. Loop has 3 letters. [2025-02-17 22:49:07,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 6 letters. [2025-02-17 22:49:07,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:07,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 939 states and 2820 transitions. [2025-02-17 22:49:07,170 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 218 [2025-02-17 22:49:07,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 939 states to 816 states and 2448 transitions. [2025-02-17 22:49:07,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 400 [2025-02-17 22:49:07,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2025-02-17 22:49:07,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 816 states and 2448 transitions. [2025-02-17 22:49:07,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:07,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 816 states and 2448 transitions. [2025-02-17 22:49:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states and 2448 transitions. [2025-02-17 22:49:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 504. [2025-02-17 22:49:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 504 states have (on average 3.0674603174603177) internal successors, (1546), 503 states have internal predecessors, (1546), 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:49:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1546 transitions. [2025-02-17 22:49:07,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 504 states and 1546 transitions. [2025-02-17 22:49:07,209 INFO L432 stractBuchiCegarLoop]: Abstraction has 504 states and 1546 transitions. [2025-02-17 22:49:07,209 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:07,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 1546 transitions. [2025-02-17 22:49:07,211 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 107 [2025-02-17 22:49:07,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:07,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:07,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:07,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:07,212 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-02-17 22:49:07,212 INFO L754 eck$LassoCheckResult]: Loop: "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -800050722, now seen corresponding path program 1 times [2025-02-17 22:49:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500021756] [2025-02-17 22:49:07,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:07,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:07,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 1 times [2025-02-17 22:49:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130647377] [2025-02-17 22:49:07,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:07,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:07,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:07,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:07,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1537445123, now seen corresponding path program 1 times [2025-02-17 22:49:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:07,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334806628] [2025-02-17 22:49:07,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:07,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:07,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:07,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:07,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:07,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:07,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:07,293 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:49:07,322 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,323 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:07,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:49:07,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,323 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,403 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,404 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,406 INFO L229 MonitoredProcess]: Starting monitored process 14 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:49:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:49:07,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,424 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,424 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {y1=1, x=0} Honda state: {y1=1, x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:49:07,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,431 INFO L229 MonitoredProcess]: Starting monitored process 15 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:49:07,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:49:07,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,452 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,452 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {tx=0} Honda state: {tx=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:49:07,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,460 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:07,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:49:07,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,472 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,472 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:49:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,480 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49:07,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:49:07,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,499 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,499 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:07,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,506 INFO L229 MonitoredProcess]: Starting monitored process 18 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:49:07,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:49:07,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,519 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,519 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar1=0} Honda state: {thread2Thread1of1ForFork1_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:49:07,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,527 INFO L229 MonitoredProcess]: Starting monitored process 19 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:49:07,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:49:07,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,528 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,539 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:07,539 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:49:07,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:49:07,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,546 INFO L229 MonitoredProcess]: Starting monitored process 20 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:49:07,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:49:07,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:07,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:49:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,571 INFO L229 MonitoredProcess]: Starting monitored process 21 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:49:07,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:49:07,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:07,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:07,695 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:07,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:07,700 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:07,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:07,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:07,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:07,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:07,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:07,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:07,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:49:07,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:07,701 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:07,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:07,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:07,765 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,767 INFO L229 MonitoredProcess]: Starting monitored process 22 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:49:07,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:49:07,772 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:49:07,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:49:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,797 INFO L229 MonitoredProcess]: Starting monitored process 23 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:49:07,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:49:07,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:49:07,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,820 INFO L229 MonitoredProcess]: Starting monitored process 24 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:49:07,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:49:07,823 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:49:07,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,845 INFO L229 MonitoredProcess]: Starting monitored process 25 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:49:07,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:49:07,847 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:49:07,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,870 INFO L229 MonitoredProcess]: Starting monitored process 26 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:49:07,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:49:07,872 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:49:07,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,894 INFO L229 MonitoredProcess]: Starting monitored process 27 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:49:07,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:49:07,896 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:49:07,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:07,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:49:07,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,922 INFO L229 MonitoredProcess]: Starting monitored process 28 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:49:07,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:49:07,923 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:49:07,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:07,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:07,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:07,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:07,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:49:07,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:49:07,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:07,943 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:07,943 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:07,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:07,945 INFO L229 MonitoredProcess]: Starting monitored process 29 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:49:07,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:49:07,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:07,961 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:49:07,962 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:07,962 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, t, n) = -2*x1 - 1*t + 2*n Supporting invariants [-1*t - 1 >= 0] [2025-02-17 22:49:07,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:49:07,971 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:49:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:07,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:07,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:49:07,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,005 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,038 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:49:08,039 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:49:08,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 504 states and 1546 transitions. cyclomatic complexity: 1122 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:08,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 504 states and 1546 transitions. cyclomatic complexity: 1122. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 1200 states and 3648 transitions. Complement of second has 7 states. [2025-02-17 22:49:08,114 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:49:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:49:08,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:49:08,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 10 letters. Loop has 3 letters. [2025-02-17 22:49:08,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 7 letters. Loop has 6 letters. [2025-02-17 22:49:08,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1200 states and 3648 transitions. [2025-02-17 22:49:08,124 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 236 [2025-02-17 22:49:08,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1200 states to 1077 states and 3277 transitions. [2025-02-17 22:49:08,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2025-02-17 22:49:08,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2025-02-17 22:49:08,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1077 states and 3277 transitions. [2025-02-17 22:49:08,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1077 states and 3277 transitions. [2025-02-17 22:49:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states and 3277 transitions. [2025-02-17 22:49:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 763. [2025-02-17 22:49:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 763 states have (on average 3.0996068152031455) internal successors, (2365), 762 states have internal predecessors, (2365), 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:49:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2365 transitions. [2025-02-17 22:49:08,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 763 states and 2365 transitions. [2025-02-17 22:49:08,157 INFO L432 stractBuchiCegarLoop]: Abstraction has 763 states and 2365 transitions. [2025-02-17 22:49:08,157 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:08,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 763 states and 2365 transitions. [2025-02-17 22:49:08,160 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 125 [2025-02-17 22:49:08,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:08,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,161 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,161 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1017504486, now seen corresponding path program 1 times [2025-02-17 22:49:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725414206] [2025-02-17 22:49:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:08,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:08,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:08,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:08,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2025-02-17 22:49:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078083591] [2025-02-17 22:49:08,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1430729368, now seen corresponding path program 1 times [2025-02-17 22:49:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337815264] [2025-02-17 22:49:08,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:08,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:08,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,201 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:08,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:08,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,216 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,216 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:08,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:08,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,229 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,229 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:08,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,231 INFO L229 MonitoredProcess]: Starting monitored process 30 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:49:08,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-17 22:49:08,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:08,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-17 22:49:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,251 INFO L229 MonitoredProcess]: Starting monitored process 31 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:49:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-17 22:49:08,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:08,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:49:08,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:08,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-17 22:49:08,338 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:08,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:08,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,354 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,373 INFO L229 MonitoredProcess]: Starting monitored process 32 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:49:08,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-17 22:49:08,375 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:49:08,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:08,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:08,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:08,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:08,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:08,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:08,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:08,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:08,393 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:08,393 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,395 INFO L229 MonitoredProcess]: Starting monitored process 33 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:49:08,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-17 22:49:08,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:08,397 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:08,397 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:08,397 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:49:08,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-17 22:49:08,404 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:08,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:08,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:08,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:08,439 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:49:08,440 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:49:08,440 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 2365 transitions. cyclomatic complexity: 1717 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:08,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 2365 transitions. cyclomatic complexity: 1717. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 2411 states and 6817 transitions. Complement of second has 7 states. [2025-02-17 22:49:08,497 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:49:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-17 22:49:08,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:08,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2411 states and 6817 transitions. [2025-02-17 22:49:08,514 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 161 [2025-02-17 22:49:08,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2411 states to 1916 states and 5399 transitions. [2025-02-17 22:49:08,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 697 [2025-02-17 22:49:08,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 757 [2025-02-17 22:49:08,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1916 states and 5399 transitions. [2025-02-17 22:49:08,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1916 states and 5399 transitions. [2025-02-17 22:49:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states and 5399 transitions. [2025-02-17 22:49:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1553. [2025-02-17 22:49:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1553 states have (on average 2.9568576947842886) internal successors, (4592), 1552 states have internal predecessors, (4592), 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:49:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4592 transitions. [2025-02-17 22:49:08,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1553 states and 4592 transitions. [2025-02-17 22:49:08,558 INFO L432 stractBuchiCegarLoop]: Abstraction has 1553 states and 4592 transitions. [2025-02-17 22:49:08,558 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:08,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1553 states and 4592 transitions. [2025-02-17 22:49:08,564 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 121 [2025-02-17 22:49:08,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:08,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:08,565 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,565 INFO L754 eck$LassoCheckResult]: Loop: "[94] L59-->L53-2: Formula: (= v_x1_6 (+ v_x1_5 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[92] L53-->L59: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -49625759, now seen corresponding path program 1 times [2025-02-17 22:49:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546120065] [2025-02-17 22:49:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:49:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:49:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,589 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:49:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546120065] [2025-02-17 22:49:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546120065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:08,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633943818] [2025-02-17 22:49:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:08,593 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:08,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash 122976, now seen corresponding path program 2 times [2025-02-17 22:49:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367615616] [2025-02-17 22:49:08,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:08,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:08,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:49:08,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:49:08,614 INFO L87 Difference]: Start difference. First operand 1553 states and 4592 transitions. cyclomatic complexity: 3257 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:49:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:08,639 INFO L93 Difference]: Finished difference Result 1500 states and 4297 transitions. [2025-02-17 22:49:08,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1500 states and 4297 transitions. [2025-02-17 22:49:08,647 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 125 [2025-02-17 22:49:08,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1500 states to 1303 states and 3718 transitions. [2025-02-17 22:49:08,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2025-02-17 22:49:08,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2025-02-17 22:49:08,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1303 states and 3718 transitions. [2025-02-17 22:49:08,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1303 states and 3718 transitions. [2025-02-17 22:49:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states and 3718 transitions. [2025-02-17 22:49:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1215. [2025-02-17 22:49:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1215 states have (on average 2.8930041152263373) internal successors, (3515), 1214 states have internal predecessors, (3515), 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:49:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3515 transitions. [2025-02-17 22:49:08,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1215 states and 3515 transitions. [2025-02-17 22:49:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:49:08,709 INFO L432 stractBuchiCegarLoop]: Abstraction has 1215 states and 3515 transitions. [2025-02-17 22:49:08,709 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:08,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1215 states and 3515 transitions. [2025-02-17 22:49:08,714 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 105 [2025-02-17 22:49:08,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,714 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:08,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:08,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-17 22:49:08,715 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[85] $Ultimate##0-->L49: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[87] L49-->L53-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,715 INFO L754 eck$LassoCheckResult]: Loop: "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash -49595008, now seen corresponding path program 1 times [2025-02-17 22:49:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51778384] [2025-02-17 22:49:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:49:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:49:08,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:08,730 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:49:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51778384] [2025-02-17 22:49:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51778384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026331837] [2025-02-17 22:49:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:08,730 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 122014, now seen corresponding path program 2 times [2025-02-17 22:49:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291157715] [2025-02-17 22:49:08,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:49:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:49:08,754 INFO L87 Difference]: Start difference. First operand 1215 states and 3515 transitions. cyclomatic complexity: 2475 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:49:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:08,770 INFO L93 Difference]: Finished difference Result 1116 states and 3098 transitions. [2025-02-17 22:49:08,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1116 states and 3098 transitions. [2025-02-17 22:49:08,776 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 76 [2025-02-17 22:49:08,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1116 states to 924 states and 2538 transitions. [2025-02-17 22:49:08,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2025-02-17 22:49:08,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2025-02-17 22:49:08,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 924 states and 2538 transitions. [2025-02-17 22:49:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:08,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 924 states and 2538 transitions. [2025-02-17 22:49:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states and 2538 transitions. [2025-02-17 22:49:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 859. [2025-02-17 22:49:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 859 states have (on average 2.781140861466822) internal successors, (2389), 858 states have internal predecessors, (2389), 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:49:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2389 transitions. [2025-02-17 22:49:08,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 859 states and 2389 transitions. [2025-02-17 22:49:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:49:08,796 INFO L432 stractBuchiCegarLoop]: Abstraction has 859 states and 2389 transitions. [2025-02-17 22:49:08,796 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:49:08,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 859 states and 2389 transitions. [2025-02-17 22:49:08,798 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:08,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:08,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,799 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[88] L53-2-->thread2FINAL: Formula: (< v_n_1 v_x1_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[90] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:08,799 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1538399445, now seen corresponding path program 1 times [2025-02-17 22:49:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868749695] [2025-02-17 22:49:08,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:08,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:08,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 2 times [2025-02-17 22:49:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30588122] [2025-02-17 22:49:08,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash -933113747, now seen corresponding path program 1 times [2025-02-17 22:49:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431609605] [2025-02-17 22:49:08,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:08,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:49:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:49:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:49:08,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:49:08,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:08,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:08,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:08,843 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,843 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:08,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:08,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,858 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,858 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,861 INFO L229 MonitoredProcess]: Starting monitored process 34 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:49:08,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-17 22:49:08,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:08,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-17 22:49:08,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,885 INFO L229 MonitoredProcess]: Starting monitored process 35 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:49:08,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-17 22:49:08,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:08,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:08,964 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:08,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-17 22:49:08,969 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:08,969 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:08,969 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:08,969 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:08,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:08,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,969 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:08,969 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:08,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:08,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:08,969 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:08,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:08,987 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:08,987 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:08,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:08,989 INFO L229 MonitoredProcess]: Starting monitored process 36 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:49:08,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-17 22:49:08,996 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:49:09,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:09,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:09,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:09,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:09,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:09,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:09,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:09,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:09,016 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:09,016 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,021 INFO L229 MonitoredProcess]: Starting monitored process 37 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:49:09,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-17 22:49:09,023 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:09,023 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:09,023 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:09,023 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x1) = 1*x2 - 1*x1 Supporting invariants [] [2025-02-17 22:49:09,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,030 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:09,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:09,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:09,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,073 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:49:09,074 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:49:09,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 859 states and 2389 transitions. cyclomatic complexity: 1653 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:49:09,117 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 859 states and 2389 transitions. cyclomatic complexity: 1653. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 2053 states and 5475 transitions. Complement of second has 7 states. [2025-02-17 22:49:09,117 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:49:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:49:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-17 22:49:09,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:09,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:49:09,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:49:09,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2053 states and 5475 transitions. [2025-02-17 22:49:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:09,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2053 states to 1260 states and 3299 transitions. [2025-02-17 22:49:09,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2025-02-17 22:49:09,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2025-02-17 22:49:09,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1260 states and 3299 transitions. [2025-02-17 22:49:09,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:09,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1260 states and 3299 transitions. [2025-02-17 22:49:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states and 3299 transitions. [2025-02-17 22:49:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 808. [2025-02-17 22:49:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 808 states have (on average 2.7636138613861387) internal successors, (2233), 807 states have internal predecessors, (2233), 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:49:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2233 transitions. [2025-02-17 22:49:09,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 808 states and 2233 transitions. [2025-02-17 22:49:09,157 INFO L432 stractBuchiCegarLoop]: Abstraction has 808 states and 2233 transitions. [2025-02-17 22:49:09,158 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:49:09,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 2233 transitions. [2025-02-17 22:49:09,160 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:09,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:09,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:09,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:09,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:09,161 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[79] L29-2-->thread1FINAL: Formula: (< v_x_4 v_y1_4) InVars {y1=v_y1_4, x=v_x_4} OutVars{y1=v_y1_4, x=v_x_4} AuxVars[] AssignedVars[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[108] thread1EXIT-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:09,161 INFO L754 eck$LassoCheckResult]: Loop: "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:09,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1167809060, now seen corresponding path program 1 times [2025-02-17 22:49:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046368950] [2025-02-17 22:49:09,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:09,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:09,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:09,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:09,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 3 times [2025-02-17 22:49:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787423331] [2025-02-17 22:49:09,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:49:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:49:09,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1278045538, now seen corresponding path program 1 times [2025-02-17 22:49:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354847421] [2025-02-17 22:49:09,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:09,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:09,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:09,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:09,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,224 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,225 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:09,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-02-17 22:49:09,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,225 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-17 22:49:09,239 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,239 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:09,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,241 INFO L229 MonitoredProcess]: Starting monitored process 38 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:49:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-17 22:49:09,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:09,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,263 INFO L229 MonitoredProcess]: Starting monitored process 39 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:49:09,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-17 22:49:09,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:09,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,346 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:09,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-17 22:49:09,354 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:09,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,354 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-02-17 22:49:09,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,368 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,368 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,370 INFO L229 MonitoredProcess]: Starting monitored process 40 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:49:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-17 22:49:09,373 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:49:09,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:09,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:09,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:09,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:09,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:09,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:09,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:09,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:09,387 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:09,387 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,389 INFO L229 MonitoredProcess]: Starting monitored process 41 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:49:09,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-17 22:49:09,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:09,391 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:09,391 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:09,391 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:49:09,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,400 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:09,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:49:09,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:49:09,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,453 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:49:09,454 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:49:09,454 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 2233 transitions. cyclomatic complexity: 1540 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:09,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 2233 transitions. cyclomatic complexity: 1540. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 2362 states and 6293 transitions. Complement of second has 7 states. [2025-02-17 22:49:09,502 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:49:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-17 22:49:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:49:09,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 15 letters. Loop has 2 letters. [2025-02-17 22:49:09,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 13 letters. Loop has 4 letters. [2025-02-17 22:49:09,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2362 states and 6293 transitions. [2025-02-17 22:49:09,515 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:09,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2362 states to 1741 states and 4537 transitions. [2025-02-17 22:49:09,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2025-02-17 22:49:09,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2025-02-17 22:49:09,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1741 states and 4537 transitions. [2025-02-17 22:49:09,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:09,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1741 states and 4537 transitions. [2025-02-17 22:49:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states and 4537 transitions. [2025-02-17 22:49:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1325. [2025-02-17 22:49:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1325 states have (on average 2.809811320754717) internal successors, (3723), 1324 states have internal predecessors, (3723), 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:49:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 3723 transitions. [2025-02-17 22:49:09,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1325 states and 3723 transitions. [2025-02-17 22:49:09,552 INFO L432 stractBuchiCegarLoop]: Abstraction has 1325 states and 3723 transitions. [2025-02-17 22:49:09,552 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-17 22:49:09,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1325 states and 3723 transitions. [2025-02-17 22:49:09,556 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:09,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:09,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:09,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:09,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:09,557 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:09,558 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1788748087, now seen corresponding path program 1 times [2025-02-17 22:49:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120776502] [2025-02-17 22:49:09,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:09,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:09,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 4 times [2025-02-17 22:49:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236060608] [2025-02-17 22:49:09,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:49:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-17 22:49:09,578 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,578 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:49:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash 999996281, now seen corresponding path program 2 times [2025-02-17 22:49:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867366949] [2025-02-17 22:49:09,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:49:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-17 22:49:09,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-17 22:49:09,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:49:09,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-17 22:49:09,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-17 22:49:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,606 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,606 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,606 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:09,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:49:09,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,606 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,621 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,622 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:09,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,624 INFO L229 MonitoredProcess]: Starting monitored process 42 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:49:09,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-17 22:49:09,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:09,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,646 INFO L229 MonitoredProcess]: Starting monitored process 43 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:49:09,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-17 22:49:09,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:09,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,722 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-17 22:49:09,727 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:09,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,728 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,728 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:49:09,728 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,728 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,743 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:09,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,745 INFO L229 MonitoredProcess]: Starting monitored process 44 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:49:09,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-17 22:49:09,747 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:49:09,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:09,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:09,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:09,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:09,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:09,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:09,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:09,760 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:09,763 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:09,763 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:09,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,786 INFO L229 MonitoredProcess]: Starting monitored process 45 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:49:09,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-17 22:49:09,789 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:09,789 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:09,789 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:09,789 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:49:09,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-17 22:49:09,795 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-17 22:49:09,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-17 22:49:09,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,840 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:49:09,840 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:49:09,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1325 states and 3723 transitions. cyclomatic complexity: 2575 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:09,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:09,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1325 states and 3723 transitions. cyclomatic complexity: 2575. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 3890 states and 10440 transitions. Complement of second has 7 states. [2025-02-17 22:49:09,922 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:49:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:49:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:49:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-17 22:49:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-17 22:49:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 14 letters. Loop has 4 letters. [2025-02-17 22:49:09,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:09,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3890 states and 10440 transitions. [2025-02-17 22:49:09,947 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:09,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3890 states to 2782 states and 7401 transitions. [2025-02-17 22:49:09,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2025-02-17 22:49:09,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 664 [2025-02-17 22:49:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2782 states and 7401 transitions. [2025-02-17 22:49:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:09,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2782 states and 7401 transitions. [2025-02-17 22:49:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states and 7401 transitions. [2025-02-17 22:49:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 1539. [2025-02-17 22:49:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1539 states have (on average 2.818713450292398) internal successors, (4338), 1538 states have internal predecessors, (4338), 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:49:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 4338 transitions. [2025-02-17 22:49:10,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1539 states and 4338 transitions. [2025-02-17 22:49:10,008 INFO L432 stractBuchiCegarLoop]: Abstraction has 1539 states and 4338 transitions. [2025-02-17 22:49:10,008 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-17 22:49:10,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1539 states and 4338 transitions. [2025-02-17 22:49:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 56 [2025-02-17 22:49:10,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:10,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:10,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:10,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:10,015 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[78] $Ultimate##0-->L29-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[104] L15-->$Ultimate##0: 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]" "[84] $Ultimate##0-->L45: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[83] L29-->L29-2: Formula: (= v_y1_2 (+ v_tx_3 v_y1_3 1)) InVars {y1=v_y1_3, tx=v_tx_3} OutVars{y1=v_y1_2, tx=v_tx_3} AuxVars[] AssignedVars[y1]" "[86] L45-->L53-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[80] L29-2-->L29: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[89] L53-2-->L53: Formula: (<= v_x1_2 v_n_2) InVars {x1=v_x1_2, n=v_n_2} OutVars{x1=v_x1_2, n=v_n_2} AuxVars[] AssignedVars[]" "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[93] L55-->L53-2: Formula: (= (+ v_x1_4 v_t_3) v_x1_3) InVars {x1=v_x1_4, t=v_t_3} OutVars{x1=v_x1_3, t=v_t_3} AuxVars[] AssignedVars[x1]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:10,015 INFO L754 eck$LassoCheckResult]: Loop: "[98] L69-->L67: Formula: (= v_x2_3 (+ v_x2_2 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[96] L67-->L69: Formula: (< v_x1_7 v_x2_1) InVars {x1=v_x1_7, x2=v_x2_1} OutVars{x1=v_x1_7, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:49:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -383177595, now seen corresponding path program 3 times [2025-02-17 22:49:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452846627] [2025-02-17 22:49:10,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:49:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:10,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-02-17 22:49:10,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:10,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-17 22:49:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:10,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:10,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:10,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:10,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 5 times [2025-02-17 22:49:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:10,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004717961] [2025-02-17 22:49:10,025 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-17 22:49:10,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:10,027 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:10,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:10,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:49:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:10,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:10,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:10,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1133521795, now seen corresponding path program 4 times [2025-02-17 22:49:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:10,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746761890] [2025-02-17 22:49:10,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:49:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:10,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-17 22:49:10,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-17 22:49:10,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:49:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:10,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-17 22:49:10,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-17 22:49:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:10,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:10,051 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:10,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:10,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:10,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:10,051 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:10,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:10,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:10,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration10_Loop [2025-02-17 22:49:10,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:10,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:10,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:10,065 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:10,065 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:10,067 INFO L229 MonitoredProcess]: Starting monitored process 46 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:49:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-17 22:49:10,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:10,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:10,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-17 22:49:10,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:10,089 INFO L229 MonitoredProcess]: Starting monitored process 47 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:49:10,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-17 22:49:10,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:10,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:10,175 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:10,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:10,179 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:10,179 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:10,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:10,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:10,179 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:10,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:10,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:10,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration10_Loop [2025-02-17 22:49:10,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:10,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:10,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:10,192 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:10,192 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:10,194 INFO L229 MonitoredProcess]: Starting monitored process 48 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:49:10,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-17 22:49:10,196 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:49:10,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:10,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:10,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:10,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:10,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:10,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:10,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:10,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:10,211 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:10,211 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:10,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:10,213 INFO L229 MonitoredProcess]: Starting monitored process 49 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:49:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-17 22:49:10,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:10,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:10,215 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:10,215 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:49:10,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-17 22:49:10,221 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,262 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:49:10,262 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:49:10,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 2631 states and 7104 transitions. Complement of second has 7 states. [2025-02-17 22:49:10,297 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:49:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-02-17 22:49:10,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 15 letters. Loop has 2 letters. [2025-02-17 22:49:10,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,298 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:49:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:10,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:10,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:10,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:10,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,339 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:49:10,339 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:49:10,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 2631 states and 7104 transitions. Complement of second has 7 states. [2025-02-17 22:49:10,374 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:49:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-02-17 22:49:10,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 15 letters. Loop has 2 letters. [2025-02-17 22:49:10,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,375 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:49:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:10,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-17 22:49:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-17 22:49:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:10,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:10,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:10,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:10,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:10,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:10,418 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:49:10,419 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:49:10,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-17 22:49:10,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1539 states and 4338 transitions. cyclomatic complexity: 3000. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 3897 states and 10499 transitions. Complement of second has 6 states. [2025-02-17 22:49:10,501 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:49:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:49:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-17 22:49:10,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 15 letters. Loop has 2 letters. [2025-02-17 22:49:10,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 17 letters. Loop has 2 letters. [2025-02-17 22:49:10,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 15 letters. Loop has 4 letters. [2025-02-17 22:49:10,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3897 states and 10499 transitions. [2025-02-17 22:49:10,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:10,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3897 states to 0 states and 0 transitions. [2025-02-17 22:49:10,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:10,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:10,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:10,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:10,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:10,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:10,521 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:10,521 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-17 22:49:10,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:10,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:10,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:10,527 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:10 BoogieIcfgContainer [2025-02-17 22:49:10,527 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:10,528 INFO L158 Benchmark]: Toolchain (without parser) took 5595.88ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 86.8MB in the beginning and 116.1MB in the end (delta: -29.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:10,528 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:10,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.82ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 85.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:10,528 INFO L158 Benchmark]: Boogie Preprocessor took 10.04ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 627.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:10,529 INFO L158 Benchmark]: RCFGBuilder took 155.62ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 75.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:10,529 INFO L158 Benchmark]: BuchiAutomizer took 5410.67ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 75.7MB in the beginning and 116.1MB in the end (delta: -40.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:10,530 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.82ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 85.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.04ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.8MB in the end (delta: 627.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 155.62ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 75.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5410.67ms. Allocated memory was 159.4MB in the beginning and 184.5MB in the end (delta: 25.2MB). Free memory was 75.7MB in the beginning and 116.1MB in the end (delta: -40.4MB). There was no memory consumed. 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 10 terminating modules (2 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 + -2 * y1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -1 * t + -2 * x1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x1 + x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 3323 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 732 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 420 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf94 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 74ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 281, Trivial Ample Sets caused by loops: 251, Number of non-trivial ample sets: 201, Number of pruned transitions: 133, Number of transitions in reduction automaton: 497, Number of states in reduction automaton: 190, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:10,543 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...