/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 -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:45:49,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:49,796 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:45:49,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:49,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:49,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:49,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:49,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:49,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:49,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:49,823 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:49,824 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:49,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:49,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:49,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:49,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:49,825 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:49,825 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:50,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:50,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:50,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:50,072 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:50,073 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:50,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/mixed_3.c.bpl [2025-02-17 22:45:50,074 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/mixed_3.c.bpl' [2025-02-17 22:45:50,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:50,086 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:50,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:50,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:50,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:50,093 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:45:50" (1/1) ... [2025-02-17 22:45:50,098 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:45:50" (1/1) ... [2025-02-17 22:45:50,102 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:50,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:50,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:50,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:50,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:50,110 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:45:50" (1/1) ... [2025-02-17 22:45:50,110 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:45:50" (1/1) ... [2025-02-17 22:45:50,111 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:45:50" (1/1) ... [2025-02-17 22:45:50,111 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:45:50" (1/1) ... [2025-02-17 22:45:50,113 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:45:50" (1/1) ... [2025-02-17 22:45:50,114 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:45:50" (1/1) ... [2025-02-17 22:45:50,118 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:45:50" (1/1) ... [2025-02-17 22:45:50,118 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:45:50" (1/1) ... [2025-02-17 22:45:50,119 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:45:50" (1/1) ... [2025-02-17 22:45:50,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:50,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:50,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:50,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:50,121 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:45:50" (1/1) ... [2025-02-17 22:45:50,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,151 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:45:50,154 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:45:50,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:50,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:50,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:50,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:50,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:45:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:45:50,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:45:50,177 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:50,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:50,177 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:45:50,211 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:50,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:50,279 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:50,279 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:50,288 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:50,288 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:50,288 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:50 BoogieIcfgContainer [2025-02-17 22:45:50,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:50,289 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:50,289 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:50,293 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:50,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:50,293 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:45:50" (1/2) ... [2025-02-17 22:45:50,294 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a133521 and model type mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:50, skipping insertion in model container [2025-02-17 22:45:50,295 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:50,295 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:45:50" (2/2) ... [2025-02-17 22:45:50,296 INFO L363 chiAutomizerObserver]: Analyzing ICFG mixed_3.c.bpl [2025-02-17 22:45:50,367 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:45:50,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:45:50,422 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-17 22:45:50,424 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:45:50,427 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:45:50,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:45:50,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-02-17 22:45:50,438 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:50,439 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:50,439 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:50,439 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:50,439 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:50,439 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:50,439 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:50,439 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:50,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:50,507 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 210 [2025-02-17 22:45:50,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:50,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:50,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:50,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:50,511 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:50,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 272 states, but on-demand construction may add more states [2025-02-17 22:45:50,520 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 210 [2025-02-17 22:45:50,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:50,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:50,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:50,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:50,525 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:45:50,525 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:45:50,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2025-02-17 22:45:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114680579] [2025-02-17 22:45:50,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-02-17 22:45:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996226092] [2025-02-17 22:45:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash 4009932, now seen corresponding path program 1 times [2025-02-17 22:45:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605638338] [2025-02-17 22:45:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:50,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:50,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:50,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:50,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,747 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,748 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,749 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,749 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:50,749 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,749 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,749 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:45:50,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,750 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,827 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,828 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,832 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:45:50,834 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:45:50,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:50,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,861 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:45:50,863 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:45:50,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:50,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,992 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:50,997 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:45:50,998 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,998 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,998 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,998 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,998 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:50,998 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,998 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,998 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-02-17 22:45:50,998 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:51,037 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:51,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,040 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:45:51,041 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:45:51,042 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:45:51,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:51,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:51,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:51,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:51,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:51,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:51,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:51,070 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:45:51,070 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-02-17 22:45:51,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,088 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:45:51,089 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:45:51,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:51,101 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:51,102 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:51,102 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:45:51,108 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:45:51,112 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:51,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,256 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:45:51,294 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:45:51,303 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:45:51,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 272 states, but on-demand construction may add more states 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:45:51,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 272 states, but on-demand construction may add more states. 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 723 states and 2772 transitions. Complement of second has 6 states. [2025-02-17 22:45:51,473 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:45:51,478 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:45:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-02-17 22:45:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:51,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:51,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:51,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 2772 transitions. [2025-02-17 22:45:51,506 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 178 [2025-02-17 22:45:51,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 533 states and 2067 transitions. [2025-02-17 22:45:51,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2025-02-17 22:45:51,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2025-02-17 22:45:51,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 533 states and 2067 transitions. [2025-02-17 22:45:51,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:51,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 533 states and 2067 transitions. [2025-02-17 22:45:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states and 2067 transitions. [2025-02-17 22:45:51,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 411. [2025-02-17 22:45:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 411 states have (on average 4.070559610705596) internal successors, (1673), 410 states have internal predecessors, (1673), 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:45:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1673 transitions. [2025-02-17 22:45:51,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 411 states and 1673 transitions. [2025-02-17 22:45:51,562 INFO L432 stractBuchiCegarLoop]: Abstraction has 411 states and 1673 transitions. [2025-02-17 22:45:51,562 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:51,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 411 states and 1673 transitions. [2025-02-17 22:45:51,564 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 178 [2025-02-17 22:45:51,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:51,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:51,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:51,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:51,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]" "[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]" "[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:45:51,565 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:45:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 130183, now seen corresponding path program 1 times [2025-02-17 22:45:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397871879] [2025-02-17 22:45:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2025-02-17 22:45:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930544990] [2025-02-17 22:45:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 125108937, now seen corresponding path program 1 times [2025-02-17 22:45:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349339827] [2025-02-17 22:45:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:51,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:51,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:51,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:51,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,613 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:51,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:51,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:51,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:51,613 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:51,613 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,613 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:51,613 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:51,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:51,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:51,614 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:51,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,635 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:51,635 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:51,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,638 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:45:51,640 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:45:51,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:51,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:51,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:51,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,660 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:45:51,661 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:45:51,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:51,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:51,738 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:51,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:51,742 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:51,743 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:51,743 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:51,743 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:51,743 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:51,743 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,743 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:51,743 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:51,743 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:51,743 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:51,743 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:51,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,762 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:51,763 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,765 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:45:51,766 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:45:51,768 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:45:51,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:51,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:51,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:51,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:51,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:51,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:51,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:51,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:51,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:51,783 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,785 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:45:51,786 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:45:51,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:51,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:51,787 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:51,787 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x1) = 1*x2 - 1*x1 Supporting invariants [] [2025-02-17 22:45:51,792 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:45:51,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,838 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:45:51,838 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:45:51,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 411 states and 1673 transitions. cyclomatic complexity: 1337 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 411 states and 1673 transitions. cyclomatic complexity: 1337. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1475 states and 6156 transitions. Complement of second has 7 states. [2025-02-17 22:45:51,901 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:45:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-17 22:45:51,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:45:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:45:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1475 states and 6156 transitions. [2025-02-17 22:45:51,916 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 142 [2025-02-17 22:45:51,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1475 states to 1056 states and 4454 transitions. [2025-02-17 22:45:51,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2025-02-17 22:45:51,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 585 [2025-02-17 22:45:51,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1056 states and 4454 transitions. [2025-02-17 22:45:51,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:51,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1056 states and 4454 transitions. [2025-02-17 22:45:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states and 4454 transitions. [2025-02-17 22:45:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 779. [2025-02-17 22:45:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 779 states have (on average 4.34017971758665) internal successors, (3381), 778 states have internal predecessors, (3381), 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:45:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3381 transitions. [2025-02-17 22:45:51,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 779 states and 3381 transitions. [2025-02-17 22:45:51,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 779 states and 3381 transitions. [2025-02-17 22:45:51,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:51,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 3381 transitions. [2025-02-17 22:45:51,959 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 142 [2025-02-17 22:45:51,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:51,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:51,960 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:51,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:51,960 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]" "[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:45:51,960 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:45:51,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash 4035046, now seen corresponding path program 1 times [2025-02-17 22:45:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479407395] [2025-02-17 22:45:51,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:51,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:51,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:51,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 1 times [2025-02-17 22:45:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011383427] [2025-02-17 22:45:51,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -50940427, now seen corresponding path program 1 times [2025-02-17 22:45:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100715599] [2025-02-17 22:45:51,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:51,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:51,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,998 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:45:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100715599] [2025-02-17 22:45:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100715599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841693463] [2025-02-17 22:45:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:52,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:52,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:52,028 INFO L87 Difference]: Start difference. First operand 779 states and 3381 transitions. cyclomatic complexity: 2724 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:52,071 INFO L93 Difference]: Finished difference Result 1049 states and 4493 transitions. [2025-02-17 22:45:52,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1049 states and 4493 transitions. [2025-02-17 22:45:52,091 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:45:52,096 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 226 [2025-02-17 22:45:52,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1049 states to 1049 states and 4493 transitions. [2025-02-17 22:45:52,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 551 [2025-02-17 22:45:52,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2025-02-17 22:45:52,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1049 states and 4493 transitions. [2025-02-17 22:45:52,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:52,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1049 states and 4493 transitions. [2025-02-17 22:45:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states and 4493 transitions. [2025-02-17 22:45:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1007. [2025-02-17 22:45:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1007 states have (on average 4.330685203574975) internal successors, (4361), 1006 states have internal predecessors, (4361), 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:45:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 4361 transitions. [2025-02-17 22:45:52,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1007 states and 4361 transitions. [2025-02-17 22:45:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:52,143 INFO L432 stractBuchiCegarLoop]: Abstraction has 1007 states and 4361 transitions. [2025-02-17 22:45:52,143 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:52,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1007 states and 4361 transitions. [2025-02-17 22:45:52,149 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 200 [2025-02-17 22:45:52,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:52,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:52,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:52,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:52,150 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]" "[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:45:52,150 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:45:52,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 4035046, now seen corresponding path program 2 times [2025-02-17 22:45:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673689813] [2025-02-17 22:45:52,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:52,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 118234, now seen corresponding path program 1 times [2025-02-17 22:45:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122123420] [2025-02-17 22:45:52,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:52,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:52,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:52,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:52,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -50940459, now seen corresponding path program 1 times [2025-02-17 22:45:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634582787] [2025-02-17 22:45:52,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:52,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:52,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:52,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,238 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,238 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:52,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:52,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,238 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,310 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,310 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,313 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:45:52,315 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:45:52,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,327 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:52,327 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:45:52,333 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:45:52,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,336 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:45:52,337 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:45:52,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,355 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:52,355 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:52,361 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:45:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,367 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:45:52,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,379 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:45:52,392 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:52,393 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:45:52,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:52,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,404 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:45:52,406 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:45:52,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:52,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,428 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:45:52,428 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:45:52,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:52,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,603 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:52,611 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:45:52,611 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:52,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:45:52,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,679 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,679 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,683 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:45:52,683 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:45:52,685 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:45:52,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:52,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:52,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:52,713 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:45:52,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,716 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:45:52,730 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:45:52,731 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:45:52,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:52,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:52,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:52,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:52,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,754 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:45:52,756 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:45:52,757 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:45:52,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:52,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:52,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:52,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,847 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:45:52,849 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:45:52,850 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:45:52,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:52,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:52,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:52,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:52,879 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:52,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,881 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:45:52,883 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:45:52,884 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:52,895 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:52,895 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:52,895 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, n, x1) = 1*t + 2*n - 2*x1 Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:45:52,901 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:45:52,904 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:52,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:52,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,979 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:45:52,979 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:45:52,979 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1007 states and 4361 transitions. cyclomatic complexity: 3523 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:53,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1007 states and 4361 transitions. cyclomatic complexity: 3523. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2281 states and 9585 transitions. Complement of second has 6 states. [2025-02-17 22:45:53,053 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:45:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-17 22:45:53,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:45:53,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:45:53,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:45:53,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2281 states and 9585 transitions. [2025-02-17 22:45:53,090 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:45:53,098 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 262 [2025-02-17 22:45:53,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2281 states to 1703 states and 6965 transitions. [2025-02-17 22:45:53,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 681 [2025-02-17 22:45:53,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2025-02-17 22:45:53,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1703 states and 6965 transitions. [2025-02-17 22:45:53,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:53,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1703 states and 6965 transitions. [2025-02-17 22:45:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states and 6965 transitions. [2025-02-17 22:45:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1502. [2025-02-17 22:45:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1502 states have (on average 4.123169107856191) internal successors, (6193), 1501 states have internal predecessors, (6193), 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:45:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 6193 transitions. [2025-02-17 22:45:53,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1502 states and 6193 transitions. [2025-02-17 22:45:53,165 INFO L432 stractBuchiCegarLoop]: Abstraction has 1502 states and 6193 transitions. [2025-02-17 22:45:53,165 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:53,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1502 states and 6193 transitions. [2025-02-17 22:45:53,174 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 236 [2025-02-17 22:45:53,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:53,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:53,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:53,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:53,175 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]" "[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:45:53,175 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:45:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 4035078, now seen corresponding path program 1 times [2025-02-17 22:45:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28204375] [2025-02-17 22:45:53,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:53,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:53,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:53,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 2 times [2025-02-17 22:45:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769421505] [2025-02-17 22:45:53,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -49987115, now seen corresponding path program 1 times [2025-02-17 22:45:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734996079] [2025-02-17 22:45:53,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:45:53,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:45:53,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,250 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,250 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:53,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:53,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,306 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,307 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:53,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,308 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:45:53,309 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:45:53,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,329 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:53,329 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:45:53,336 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:45:53,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,342 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:45:53,344 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:45:53,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,360 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:53,360 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:45:53,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,368 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:45:53,369 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:45:53,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,383 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:53,384 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:45:53,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,392 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:45:53,394 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:45:53,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,408 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:45:53,408 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:45:53,414 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:45:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,417 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:45:53,418 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:45:53,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:45:53,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,437 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:45:53,439 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:45:53,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:53,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,561 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:53,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:45:53,567 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:53,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:45:53,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,567 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,620 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,620 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,622 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:45:53,623 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:45:53,624 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:45:53,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:53,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:53,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:53,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:45:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,644 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:45:53,644 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:45:53,645 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:45:53,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:53,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:53,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:53,664 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:45:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,666 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:45:53,667 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:45:53,668 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:45:53,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:53,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:53,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:45:53,687 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:45:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,689 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:45:53,690 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:45:53,691 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:45:53,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:45:53,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:45:53,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:53,710 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:53,711 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,713 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:45:53,714 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:45:53,715 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:53,725 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:45:53,726 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:53,726 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:45:53,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,735 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:45:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:53,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:53,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,795 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:45:53,795 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:45:53,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1502 states and 6193 transitions. cyclomatic complexity: 4951 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:53,902 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:45:53,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1502 states and 6193 transitions. cyclomatic complexity: 4951. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 2805 states and 11512 transitions. Complement of second has 7 states. [2025-02-17 22:45:53,907 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:45:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:45:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-02-17 22:45:53,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:45:53,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:45:53,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:45:53,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2805 states and 11512 transitions. [2025-02-17 22:45:53,933 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 249 [2025-02-17 22:45:53,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2805 states to 2439 states and 9947 transitions. [2025-02-17 22:45:53,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 848 [2025-02-17 22:45:53,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 938 [2025-02-17 22:45:53,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2439 states and 9947 transitions. [2025-02-17 22:45:53,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:53,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2439 states and 9947 transitions. [2025-02-17 22:45:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states and 9947 transitions. [2025-02-17 22:45:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1852. [2025-02-17 22:45:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1852 states have (on average 4.0998920086393085) internal successors, (7593), 1851 states have internal predecessors, (7593), 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:45:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 7593 transitions. [2025-02-17 22:45:54,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1852 states and 7593 transitions. [2025-02-17 22:45:54,000 INFO L432 stractBuchiCegarLoop]: Abstraction has 1852 states and 7593 transitions. [2025-02-17 22:45:54,001 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:45:54,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1852 states and 7593 transitions. [2025-02-17 22:45:54,011 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 185 [2025-02-17 22:45:54,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:54,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:54,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:54,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:54,012 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]" "[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[]" [2025-02-17 22:45:54,012 INFO L754 eck$LassoCheckResult]: Loop: "[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]" "[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[]" [2025-02-17 22:45:54,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 125087507, now seen corresponding path program 1 times [2025-02-17 22:45:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971325164] [2025-02-17 22:45:54,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:54,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:54,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:54,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:54,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 120214, now seen corresponding path program 2 times [2025-02-17 22:45:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619360200] [2025-02-17 22:45:54,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:54,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:54,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:54,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:54,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1549601468, now seen corresponding path program 1 times [2025-02-17 22:45:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316304007] [2025-02-17 22:45:54,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:45:54,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:45:54,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316304007] [2025-02-17 22:45:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316304007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073397689] [2025-02-17 22:45:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:54,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:54,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:54,052 INFO L87 Difference]: Start difference. First operand 1852 states and 7593 transitions. cyclomatic complexity: 6053 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:45:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:54,080 INFO L93 Difference]: Finished difference Result 1735 states and 6925 transitions. [2025-02-17 22:45:54,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1735 states and 6925 transitions. [2025-02-17 22:45:54,094 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 124 [2025-02-17 22:45:54,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1735 states to 1390 states and 5311 transitions. [2025-02-17 22:45:54,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2025-02-17 22:45:54,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2025-02-17 22:45:54,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1390 states and 5311 transitions. [2025-02-17 22:45:54,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:54,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1390 states and 5311 transitions. [2025-02-17 22:45:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 5311 transitions. [2025-02-17 22:45:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1311. [2025-02-17 22:45:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1311 states have (on average 3.871853546910755) internal successors, (5076), 1310 states have internal predecessors, (5076), 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:45:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 5076 transitions. [2025-02-17 22:45:54,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1311 states and 5076 transitions. [2025-02-17 22:45:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:54,157 INFO L432 stractBuchiCegarLoop]: Abstraction has 1311 states and 5076 transitions. [2025-02-17 22:45:54,157 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:45:54,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1311 states and 5076 transitions. [2025-02-17 22:45:54,166 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-02-17 22:45:54,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:54,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:54,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:54,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:54,167 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]" "[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[]" "[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]" "[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:45:54,167 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:45:54,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1708663130, now seen corresponding path program 1 times [2025-02-17 22:45:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980831178] [2025-02-17 22:45:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:54,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 2 times [2025-02-17 22:45:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068899882] [2025-02-17 22:45:54,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:54,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1347757724, now seen corresponding path program 1 times [2025-02-17 22:45:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676293532] [2025-02-17 22:45:54,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:54,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:54,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:54,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:54,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,210 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:54,211 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:54,211 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:54,211 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:54,211 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:54,211 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,211 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:54,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:54,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:45:54,211 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:54,211 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:54,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:54,228 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:54,228 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,232 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:45:54,233 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:45:54,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:54,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:54,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:54,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,254 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:45:54,255 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:45:54,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:54,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:54,338 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:54,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:54,343 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:54,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:54,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:54,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:54,343 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:54,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:54,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:54,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:45:54,344 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:54,344 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:54,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:54,360 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:54,361 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,363 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:45:54,365 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:45:54,367 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:45:54,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:54,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:54,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:54,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:54,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:54,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:54,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:54,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:54,381 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:54,381 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,383 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:45:54,385 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:45:54,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:54,386 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:54,386 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:54,386 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:45:54,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:54,392 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:45:54,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:45:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,424 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,446 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:45:54,447 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:45:54,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1311 states and 5076 transitions. cyclomatic complexity: 4000 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:45:54,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1311 states and 5076 transitions. cyclomatic complexity: 4000. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 4937 states and 17909 transitions. Complement of second has 7 states. [2025-02-17 22:45:54,531 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:45:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:45:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-17 22:45:54,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-17 22:45:54,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:45:54,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-17 22:45:54,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4937 states and 17909 transitions. [2025-02-17 22:45:54,568 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-02-17 22:45:54,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4937 states to 3802 states and 13410 transitions. [2025-02-17 22:45:54,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 696 [2025-02-17 22:45:54,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 895 [2025-02-17 22:45:54,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3802 states and 13410 transitions. [2025-02-17 22:45:54,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:54,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3802 states and 13410 transitions. [2025-02-17 22:45:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states and 13410 transitions. [2025-02-17 22:45:54,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2638. [2025-02-17 22:45:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 2638 states have (on average 3.8601213040181954) internal successors, (10183), 2637 states have internal predecessors, (10183), 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:45:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 10183 transitions. [2025-02-17 22:45:54,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2638 states and 10183 transitions. [2025-02-17 22:45:54,687 INFO L432 stractBuchiCegarLoop]: Abstraction has 2638 states and 10183 transitions. [2025-02-17 22:45:54,687 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:45:54,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2638 states and 10183 transitions. [2025-02-17 22:45:54,696 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-02-17 22:45:54,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:54,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:54,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:54,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:54,696 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]" "[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[]" "[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[]" "[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:45:54,697 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:45:54,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1428802440, now seen corresponding path program 2 times [2025-02-17 22:45:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230792464] [2025-02-17 22:45:54,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:54,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:54,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:54,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 3 times [2025-02-17 22:45:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939006247] [2025-02-17 22:45:54,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-17 22:45:54,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1310392954, now seen corresponding path program 3 times [2025-02-17 22:45:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892897948] [2025-02-17 22:45:54,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-17 22:45:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:54,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-02-17 22:45:54,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:54,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-17 22:45:54,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:54,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:45:54,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:45:54,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:54,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:54,734 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:54,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:54,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:54,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:54,735 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:54,735 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,735 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:54,735 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:54,735 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-02-17 22:45:54,735 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:54,735 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:54,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:54,748 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:54,748 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:54,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,750 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:45:54,752 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:45:54,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:54,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:54,768 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:45:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,770 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:45:54,772 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:45:54,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:54,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:54,844 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:54,848 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:45:54,848 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:54,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:54,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:54,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:54,848 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:54,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:54,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:54,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-02-17 22:45:54,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:54,848 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:54,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:54,868 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:54,868 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:54,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,871 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:45:54,872 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:45:54,874 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:45:54,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:54,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:54,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:54,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:54,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:54,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:54,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:54,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:54,887 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:54,887 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:54,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,925 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:45:54,928 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:45:54,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:54,928 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:54,928 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:54,928 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:45:54,933 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:45:54,933 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:54,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:54,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,964 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,976 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:45:54,976 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:45:54,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2638 states and 10183 transitions. cyclomatic complexity: 7966 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:45:55,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2638 states and 10183 transitions. cyclomatic complexity: 7966. 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 8044 states and 29440 transitions. Complement of second has 7 states. [2025-02-17 22:45:55,096 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:45:55,096 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:45:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-17 22:45:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:45:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:45:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:55,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:45:55,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:55,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8044 states and 29440 transitions. [2025-02-17 22:45:55,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-17 22:45:55,145 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-02-17 22:45:55,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8044 states to 5525 states and 19915 transitions. [2025-02-17 22:45:55,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1039 [2025-02-17 22:45:55,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1063 [2025-02-17 22:45:55,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5525 states and 19915 transitions. [2025-02-17 22:45:55,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:55,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5525 states and 19915 transitions. [2025-02-17 22:45:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states and 19915 transitions. [2025-02-17 22:45:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 3280. [2025-02-17 22:45:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3280 states have (on average 3.8826219512195124) internal successors, (12735), 3279 states have internal predecessors, (12735), 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:45:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 12735 transitions. [2025-02-17 22:45:55,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3280 states and 12735 transitions. [2025-02-17 22:45:55,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 3280 states and 12735 transitions. [2025-02-17 22:45:55,310 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-17 22:45:55,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3280 states and 12735 transitions. [2025-02-17 22:45:55,325 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-02-17 22:45:55,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:55,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:55,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:55,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:55,326 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]" "[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[]" "[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[]" "[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:45:55,326 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:45:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1342996124, now seen corresponding path program 4 times [2025-02-17 22:45:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700084516] [2025-02-17 22:45:55,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:45:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:55,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-02-17 22:45:55,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:55,334 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:45:55,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 4 times [2025-02-17 22:45:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157205515] [2025-02-17 22:45:55,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-17 22:45:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:55,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-17 22:45:55,347 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:45:55,347 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-17 22:45:55,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:55,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:55,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:55,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:55,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2129083230, now seen corresponding path program 5 times [2025-02-17 22:45:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104995235] [2025-02-17 22:45:55,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-17 22:45:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:55,359 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-17 22:45:55,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:55,363 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-17 22:45:55,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:55,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:45:55,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:45:55,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:55,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:55,389 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:55,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:55,390 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:55,390 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:55,390 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:55,390 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,390 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:55,390 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:55,390 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:45:55,390 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:55,390 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:55,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:55,406 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:55,406 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:55,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:55,408 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:45:55,410 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:45:55,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:55,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:55,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:55,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:55,429 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:45:55,462 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:45:55,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:55,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:55,599 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:55,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-17 22:45:55,605 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:55,605 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:55,605 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:55,605 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:55,605 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:55,605 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,605 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:55,605 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:55,605 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:45:55,605 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:55,605 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:55,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:55,632 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:55,632 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:55,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:55,637 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:45:55,638 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:45:55,649 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:45:55,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:55,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:55,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:55,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:55,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:55,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:55,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:55,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:55,668 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:55,668 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:55,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:55,670 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:45:55,671 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:45:55,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:55,674 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:55,674 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:55,674 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-02-17 22:45:55,680 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:45:55,681 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:55,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:55,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:55,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:55,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:55,729 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:45:55,729 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:45:55,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:55,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 6409 states and 23888 transitions. Complement of second has 7 states. [2025-02-17 22:45:55,829 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:45:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-17 22:45:55,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:45:55,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:55,830 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:55,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:55,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:55,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:55,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:55,881 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:45:55,882 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:45:55,882 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:55,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 6409 states and 23888 transitions. Complement of second has 7 states. [2025-02-17 22:45:55,963 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:45:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-17 22:45:55,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:45:55,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:55,964 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-17 22:45:55,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:55,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:45:55,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:45:55,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:55,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:55,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:55,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:55,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:55,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:55,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:56,006 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:45:56,006 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:45:56,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:56,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3280 states and 12735 transitions. cyclomatic complexity: 9949. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 8310 states and 30707 transitions. Complement of second has 6 states. [2025-02-17 22:45:56,103 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:45:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:45:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-17 22:45:56,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:45:56,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:56,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:45:56,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:56,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:45:56,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:56,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8310 states and 30707 transitions. [2025-02-17 22:45:56,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:56,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8310 states to 0 states and 0 transitions. [2025-02-17 22:45:56,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:56,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:56,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:56,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:56,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:56,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:56,168 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:56,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-17 22:45:56,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:56,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:56,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:56,175 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:56 BoogieIcfgContainer [2025-02-17 22:45:56,175 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:56,175 INFO L158 Benchmark]: Toolchain (without parser) took 6089.29ms. Allocated memory was 159.4MB in the beginning and 293.6MB in the end (delta: 134.2MB). Free memory was 84.9MB in the beginning and 75.6MB in the end (delta: 9.4MB). Peak memory consumption was 146.7MB. Max. memory is 8.0GB. [2025-02-17 22:45:56,175 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:56,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.88ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:56,176 INFO L158 Benchmark]: Boogie Preprocessor took 14.83ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 83.0MB in the end (delta: 714.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:56,176 INFO L158 Benchmark]: RCFGBuilder took 168.27ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:56,176 INFO L158 Benchmark]: BuchiAutomizer took 5885.68ms. Allocated memory was 159.4MB in the beginning and 293.6MB in the end (delta: 134.2MB). Free memory was 74.0MB in the beginning and 75.6MB in the end (delta: -1.5MB). Peak memory consumption was 134.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:56,177 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.88ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.83ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 83.0MB in the end (delta: 714.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 168.27ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5885.68ms. Allocated memory was 159.4MB in the beginning and 293.6MB in the end (delta: 134.2MB). Free memory was 74.0MB in the beginning and 75.6MB in the end (delta: -1.5MB). Peak memory consumption was 134.2MB. 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 9 terminating modules (2 trivial, 6 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 -1 * x1 + x2 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + t 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 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.7s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 4717 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 786 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 446 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf94 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 64ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:56,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-17 22:45:56,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...