/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-a4216cd-m [2025-04-26 16:24:40,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:40,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:40,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:40,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:40,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:40,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:40,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:40,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:40,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:40,134 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:40,134 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:40,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:40,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:40,136 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:40,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:40,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:40,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:40,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:40,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:40,136 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:40,136 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:40,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:40,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:40,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:40,367 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:40,368 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:40,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/mixed_3.c.bpl [2025-04-26 16:24:40,369 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/mixed_3.c.bpl' [2025-04-26 16:24:40,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:40,388 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:40,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:40,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:40,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:40,396 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 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,417 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 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,423 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:40,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:40,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:40,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:40,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:40,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:40,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:40,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:40,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:40,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/1) ... [2025-04-26 16:24:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,475 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-04-26 16:24:40,477 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-04-26 16:24:40,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:40,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:40,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:40,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:40,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:40,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:40,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:40,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:40,502 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:40,539 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:40,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:40,631 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:40,631 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:40,638 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:40,638 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:40,638 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:40 BoogieIcfgContainer [2025-04-26 16:24:40,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:40,641 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:40,641 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:40,646 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:40,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:40,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:40" (1/2) ... [2025-04-26 16:24:40,647 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d28c002 and model type mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:40, skipping insertion in model container [2025-04-26 16:24:40,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:40,648 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:40" (2/2) ... [2025-04-26 16:24:40,649 INFO L376 chiAutomizerObserver]: Analyzing ICFG mixed_3.c.bpl [2025-04-26 16:24:40,690 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 16:24:40,738 INFO L116 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-04-26 16:24:40,742 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:40,749 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-04-26 16:24:40,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 16:24:40,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-04-26 16:24:40,752 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 28 transitions, 74 flow [2025-04-26 16:24:40,760 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:40,760 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:40,760 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:40,761 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:40,761 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:40,761 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:40,761 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:40,761 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:40,762 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:40,834 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 210 [2025-04-26 16:24:40,835 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,835 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:40,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,838 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:40,838 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 272 states, but on-demand construction may add more states [2025-04-26 16:24:40,848 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 210 [2025-04-26 16:24:40,848 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,848 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:40,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,852 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-04-26 16:24:40,853 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-04-26 16:24:40,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2025-04-26 16:24:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206745434] [2025-04-26 16:24:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:24:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656601069] [2025-04-26 16:24:40,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 4009932, now seen corresponding path program 1 times [2025-04-26 16:24:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186572080] [2025-04-26 16:24:40,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:40,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:40,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:40,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:40,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:41,019 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:41,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:41,020 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:41,020 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:41,020 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:41,020 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,020 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:41,020 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:41,020 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:24:41,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:41,020 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:41,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,075 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:41,075 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:41,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,078 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-04-26 16:24:41,079 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-04-26 16:24:41,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:41,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:41,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:41,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,118 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-04-26 16:24:41,119 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-04-26 16:24:41,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:41,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:41,249 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:41,255 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-04-26 16:24:41,255 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:41,255 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:41,255 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:41,255 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:41,255 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:41,256 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,256 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:41,256 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:41,256 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:24:41,256 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:41,256 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:41,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,309 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:41,312 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,314 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-04-26 16:24:41,316 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-04-26 16:24:41,317 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-04-26 16:24:41,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:41,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:41,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:41,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:41,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:41,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:41,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:41,346 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:24:41,346 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:24:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,349 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-04-26 16:24:41,351 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-04-26 16:24:41,352 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:41,368 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-04-26 16:24:41,369 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:41,369 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:41,369 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y1) = 2*x - 2*y1 + 1 Supporting invariants [1*tx >= 0] [2025-04-26 16:24:41,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:41,379 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:41,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,436 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:41,511 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-04-26 16:24:41,516 INFO L70 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, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:41,643 INFO L74 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, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 723 states and 2772 transitions. Complement of second has 6 states. [2025-04-26 16:24:41,645 INFO L140 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-04-26 16:24:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 16:24:41,651 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:41,651 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,651 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:41,651 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,651 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:41,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:41,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 2772 transitions. [2025-04-26 16:24:41,663 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 178 [2025-04-26 16:24:41,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 533 states and 2067 transitions. [2025-04-26 16:24:41,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2025-04-26 16:24:41,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2025-04-26 16:24:41,675 INFO L74 IsDeterministic]: Start isDeterministic. Operand 533 states and 2067 transitions. [2025-04-26 16:24:41,676 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:41,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 533 states and 2067 transitions. [2025-04-26 16:24:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states and 2067 transitions. [2025-04-26 16:24:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 411. [2025-04-26 16:24:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 411 states have (on average 4.070559610705596) internal successors, (in total 1673), 410 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1673 transitions. [2025-04-26 16:24:41,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 411 states and 1673 transitions. [2025-04-26 16:24:41,715 INFO L438 stractBuchiCegarLoop]: Abstraction has 411 states and 1673 transitions. [2025-04-26 16:24:41,715 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:41,715 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 411 states and 1673 transitions. [2025-04-26 16:24:41,719 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 178 [2025-04-26 16:24:41,720 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:41,720 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:41,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:41,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:41,720 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-04-26 16:24:41,720 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-04-26 16:24:41,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 130183, now seen corresponding path program 1 times [2025-04-26 16:24:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:41,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584614850] [2025-04-26 16:24:41,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:41,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:41,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:41,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:41,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:41,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2025-04-26 16:24:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:41,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762609078] [2025-04-26 16:24:41,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:41,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:41,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:41,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 125108937, now seen corresponding path program 1 times [2025-04-26 16:24:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:41,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788170553] [2025-04-26 16:24:41,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:41,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:41,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:41,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:41,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:41,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:41,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:41,761 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:41,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:41,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:41,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:41,761 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:41,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:41,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:41,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:41,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:41,761 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:41,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,781 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:41,781 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,784 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-04-26 16:24:41,785 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-04-26 16:24:41,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:41,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:41,803 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-04-26 16:24:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,805 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-04-26 16:24:41,806 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-04-26 16:24:41,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:41,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:41,877 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:41,882 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-04-26 16:24:41,882 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:41,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:41,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:41,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:41,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:41,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,883 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:41,883 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:41,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:41,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:41,883 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:41,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:41,900 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:41,900 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,902 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-04-26 16:24:41,903 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-04-26 16:24:41,903 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-04-26 16:24:41,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:41,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:41,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:41,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:41,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:41,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:41,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:41,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:41,919 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:41,919 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:41,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:41,921 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-04-26 16:24:41,923 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-04-26 16:24:41,924 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:41,927 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-04-26 16:24:41,927 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:41,927 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:41,927 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x1) = 1*x2 - 1*x1 Supporting invariants [] [2025-04-26 16:24:41,932 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-04-26 16:24:41,933 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:41,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:41,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:41,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:41,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:41,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:41,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:41,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:41,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:41,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:41,981 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-04-26 16:24:41,981 INFO L70 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, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:42,063 INFO L74 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, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1475 states and 6156 transitions. Complement of second has 7 states. [2025-04-26 16:24:42,063 INFO L140 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-04-26 16:24:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-26 16:24:42,064 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:42,064 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:42,064 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:42,064 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:42,064 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:42,065 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:42,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1475 states and 6156 transitions. [2025-04-26 16:24:42,085 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 142 [2025-04-26 16:24:42,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1475 states to 1056 states and 4454 transitions. [2025-04-26 16:24:42,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2025-04-26 16:24:42,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 585 [2025-04-26 16:24:42,106 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1056 states and 4454 transitions. [2025-04-26 16:24:42,106 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:42,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1056 states and 4454 transitions. [2025-04-26 16:24:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states and 4454 transitions. [2025-04-26 16:24:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 779. [2025-04-26 16:24:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 779 states have (on average 4.34017971758665) internal successors, (in total 3381), 778 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3381 transitions. [2025-04-26 16:24:42,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 779 states and 3381 transitions. [2025-04-26 16:24:42,147 INFO L438 stractBuchiCegarLoop]: Abstraction has 779 states and 3381 transitions. [2025-04-26 16:24:42,147 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:42,147 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 3381 transitions. [2025-04-26 16:24:42,153 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 142 [2025-04-26 16:24:42,153 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:42,153 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:42,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:42,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:42,153 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-04-26 16:24:42,153 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-04-26 16:24:42,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 4035046, now seen corresponding path program 1 times [2025-04-26 16:24:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951981205] [2025-04-26 16:24:42,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:42,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:42,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:42,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:42,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 1 times [2025-04-26 16:24:42,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337427554] [2025-04-26 16:24:42,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:42,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:42,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:42,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:42,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:42,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:42,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -50940427, now seen corresponding path program 1 times [2025-04-26 16:24:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094019172] [2025-04-26 16:24:42,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:42,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:42,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:42,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094019172] [2025-04-26 16:24:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094019172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:42,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764784558] [2025-04-26 16:24:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:42,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:42,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:42,251 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, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:42,297 INFO L93 Difference]: Finished difference Result 1049 states and 4493 transitions. [2025-04-26 16:24:42,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1049 states and 4493 transitions. [2025-04-26 16:24:42,311 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 226 [2025-04-26 16:24:42,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1049 states to 1049 states and 4493 transitions. [2025-04-26 16:24:42,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 551 [2025-04-26 16:24:42,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2025-04-26 16:24:42,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1049 states and 4493 transitions. [2025-04-26 16:24:42,326 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:42,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1049 states and 4493 transitions. [2025-04-26 16:24:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states and 4493 transitions. [2025-04-26 16:24:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1007. [2025-04-26 16:24:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1007 states have (on average 4.330685203574975) internal successors, (in total 4361), 1006 states have internal predecessors, (4361), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 4361 transitions. [2025-04-26 16:24:42,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1007 states and 4361 transitions. [2025-04-26 16:24:42,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:42,354 INFO L438 stractBuchiCegarLoop]: Abstraction has 1007 states and 4361 transitions. [2025-04-26 16:24:42,354 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:42,354 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1007 states and 4361 transitions. [2025-04-26 16:24:42,361 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 200 [2025-04-26 16:24:42,361 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:42,361 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:42,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:42,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:42,362 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-04-26 16:24:42,362 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-04-26 16:24:42,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 4035046, now seen corresponding path program 2 times [2025-04-26 16:24:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051645451] [2025-04-26 16:24:42,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:42,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:42,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:42,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:42,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:42,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:42,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 118234, now seen corresponding path program 1 times [2025-04-26 16:24:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902327737] [2025-04-26 16:24:42,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:42,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:42,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:42,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:42,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:42,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:42,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash -50940459, now seen corresponding path program 1 times [2025-04-26 16:24:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:42,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74707364] [2025-04-26 16:24:42,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:42,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:42,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:42,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:42,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:42,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:42,429 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:42,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:42,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:42,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:42,429 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:42,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:42,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:42,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:24:42,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:42,429 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:42,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,488 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:42,489 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,491 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-04-26 16:24:42,493 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-04-26 16:24:42,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:42,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:42,505 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:42,505 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:42,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,514 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-04-26 16:24:42,516 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-04-26 16:24:42,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:42,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:42,535 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:42,535 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:42,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,543 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-04-26 16:24:42,544 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-04-26 16:24:42,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:42,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:42,565 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:42,565 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:42,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:42,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,572 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-04-26 16:24:42,573 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-04-26 16:24:42,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:42,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:42,593 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-04-26 16:24:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,599 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-04-26 16:24:42,601 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-04-26 16:24:42,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:42,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:42,755 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:42,762 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-04-26 16:24:42,762 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:42,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:42,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:42,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:42,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:42,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:42,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:42,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:24:42,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:42,762 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:42,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:42,826 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:42,827 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,829 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-04-26 16:24:42,831 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-04-26 16:24:42,833 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-04-26 16:24:42,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:42,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:42,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:42,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:42,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:42,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:42,851 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:42,862 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-04-26 16:24:42,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,898 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-04-26 16:24:42,900 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-04-26 16:24:42,901 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-04-26 16:24:42,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:42,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:42,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:42,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:42,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:42,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:42,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:42,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:42,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,932 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-04-26 16:24:42,934 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-04-26 16:24:42,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:42,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:42,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:42,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:42,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:42,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:42,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:42,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:42,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,957 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-04-26 16:24:42,958 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-04-26 16:24:42,960 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-04-26 16:24:42,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:42,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:42,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:42,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:42,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:42,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:42,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:42,980 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:42,980 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:42,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:42,983 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-04-26 16:24:42,984 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-04-26 16:24:42,985 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:43,002 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-04-26 16:24:43,002 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:43,002 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:43,002 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, n, x1) = 1*t + 2*n - 2*x1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 16:24:43,008 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-04-26 16:24:43,012 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:43,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:43,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:43,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:43,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:43,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:43,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:43,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:43,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:43,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:43,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:43,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:43,081 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-04-26 16:24:43,081 INFO L70 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, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:43,204 INFO L74 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, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2281 states and 9585 transitions. Complement of second has 6 states. [2025-04-26 16:24:43,204 INFO L140 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-04-26 16:24:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:24:43,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:24:43,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:43,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:24:43,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:43,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:24:43,206 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:43,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2281 states and 9585 transitions. [2025-04-26 16:24:43,231 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 262 [2025-04-26 16:24:43,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2281 states to 1703 states and 6965 transitions. [2025-04-26 16:24:43,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 681 [2025-04-26 16:24:43,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2025-04-26 16:24:43,252 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1703 states and 6965 transitions. [2025-04-26 16:24:43,252 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:43,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1703 states and 6965 transitions. [2025-04-26 16:24:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states and 6965 transitions. [2025-04-26 16:24:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1502. [2025-04-26 16:24:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1502 states have (on average 4.123169107856191) internal successors, (in total 6193), 1501 states have internal predecessors, (6193), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 6193 transitions. [2025-04-26 16:24:43,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1502 states and 6193 transitions. [2025-04-26 16:24:43,291 INFO L438 stractBuchiCegarLoop]: Abstraction has 1502 states and 6193 transitions. [2025-04-26 16:24:43,291 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:43,291 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1502 states and 6193 transitions. [2025-04-26 16:24:43,300 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 236 [2025-04-26 16:24:43,300 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:43,301 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:43,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:43,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:43,301 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-04-26 16:24:43,301 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-04-26 16:24:43,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash 4035078, now seen corresponding path program 1 times [2025-04-26 16:24:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:43,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214833946] [2025-04-26 16:24:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:43,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:43,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:43,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:43,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:43,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:43,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 118266, now seen corresponding path program 2 times [2025-04-26 16:24:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:43,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388552047] [2025-04-26 16:24:43,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:43,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:43,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:43,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:43,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:43,327 INFO L85 PathProgramCache]: Analyzing trace with hash -49987115, now seen corresponding path program 1 times [2025-04-26 16:24:43,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:43,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497027003] [2025-04-26 16:24:43,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:43,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:43,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:43,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:43,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:43,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:43,376 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:43,376 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:43,376 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:43,376 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:43,376 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:43,376 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,376 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:43,376 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:43,376 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:24:43,376 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:43,376 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:43,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,430 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:43,430 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,432 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-04-26 16:24:43,435 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-04-26 16:24:43,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:43,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,453 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:43,453 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:43,458 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-04-26 16:24:43,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,460 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-04-26 16:24:43,461 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-04-26 16:24:43,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:43,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,473 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:43,473 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:43,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:24:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,481 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-04-26 16:24:43,482 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-04-26 16:24:43,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:43,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,493 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:43,494 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:43,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:24:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,501 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-04-26 16:24:43,503 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-04-26 16:24:43,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:43,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,515 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:43,515 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar1=0} Honda state: {thread2Thread1of1ForFork1_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:43,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:24:43,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,523 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-04-26 16:24:43,524 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-04-26 16:24:43,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:43,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,541 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-04-26 16:24:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,543 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-04-26 16:24:43,545 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-04-26 16:24:43,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:43,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:43,666 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:43,672 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-04-26 16:24:43,672 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:43,673 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:43,673 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:43,673 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:43,673 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:43,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:43,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:43,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:24:43,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:43,673 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:43,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:43,742 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:43,742 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:43,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,744 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-04-26 16:24:43,745 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-04-26 16:24:43,746 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-04-26 16:24:43,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:43,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:43,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:43,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:43,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:43,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:43,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:43,765 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-04-26 16:24:43,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,767 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-04-26 16:24:43,768 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-04-26 16:24:43,769 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-04-26 16:24:43,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:43,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:43,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:43,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:43,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:43,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:43,782 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:43,790 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-04-26 16:24:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,825 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-04-26 16:24:43,826 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-04-26 16:24:43,827 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-04-26 16:24:43,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:43,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:43,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:43,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:43,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:43,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:43,844 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:43,850 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-04-26 16:24:43,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,852 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-04-26 16:24:43,853 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-04-26 16:24:43,854 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-04-26 16:24:43,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:43,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:43,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:43,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:43,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:43,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:43,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:43,874 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:43,875 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:43,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:43,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:43,877 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-04-26 16:24:43,878 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-04-26 16:24:43,879 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:43,896 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-04-26 16:24:43,896 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:43,896 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:43,896 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, t, n) = -2*x1 - 1*t + 2*n Supporting invariants [-1*t - 1 >= 0] [2025-04-26 16:24:43,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:24:43,905 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:43,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:43,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:43,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:43,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:43,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:43,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:43,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:43,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:43,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:43,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:43,967 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-04-26 16:24:43,968 INFO L70 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, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,037 INFO L74 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, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2805 states and 11512 transitions. Complement of second has 7 states. [2025-04-26 16:24:44,037 INFO L140 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-04-26 16:24:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:24:44,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:24:44,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:24:44,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:24:44,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2805 states and 11512 transitions. [2025-04-26 16:24:44,063 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 249 [2025-04-26 16:24:44,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2805 states to 2439 states and 9947 transitions. [2025-04-26 16:24:44,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 848 [2025-04-26 16:24:44,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 938 [2025-04-26 16:24:44,086 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2439 states and 9947 transitions. [2025-04-26 16:24:44,086 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:44,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2439 states and 9947 transitions. [2025-04-26 16:24:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states and 9947 transitions. [2025-04-26 16:24:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1852. [2025-04-26 16:24:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1852 states have (on average 4.0998920086393085) internal successors, (in total 7593), 1851 states have internal predecessors, (7593), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 7593 transitions. [2025-04-26 16:24:44,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1852 states and 7593 transitions. [2025-04-26 16:24:44,151 INFO L438 stractBuchiCegarLoop]: Abstraction has 1852 states and 7593 transitions. [2025-04-26 16:24:44,151 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:24:44,151 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1852 states and 7593 transitions. [2025-04-26 16:24:44,162 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 185 [2025-04-26 16:24:44,162 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:44,163 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:44,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:44,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:44,163 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-04-26 16:24:44,163 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-04-26 16:24:44,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 125087507, now seen corresponding path program 1 times [2025-04-26 16:24:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702387315] [2025-04-26 16:24:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:44,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:44,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:44,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash 120214, now seen corresponding path program 2 times [2025-04-26 16:24:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992123785] [2025-04-26 16:24:44,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:44,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:44,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:44,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:44,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1549601468, now seen corresponding path program 1 times [2025-04-26 16:24:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8260719] [2025-04-26 16:24:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:44,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:44,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:44,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8260719] [2025-04-26 16:24:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8260719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019534362] [2025-04-26 16:24:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:44,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:44,204 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, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:44,230 INFO L93 Difference]: Finished difference Result 1735 states and 6925 transitions. [2025-04-26 16:24:44,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1735 states and 6925 transitions. [2025-04-26 16:24:44,246 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 124 [2025-04-26 16:24:44,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1735 states to 1390 states and 5311 transitions. [2025-04-26 16:24:44,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2025-04-26 16:24:44,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2025-04-26 16:24:44,259 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1390 states and 5311 transitions. [2025-04-26 16:24:44,259 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:44,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1390 states and 5311 transitions. [2025-04-26 16:24:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 5311 transitions. [2025-04-26 16:24:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1311. [2025-04-26 16:24:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1311 states have (on average 3.871853546910755) internal successors, (in total 5076), 1310 states have internal predecessors, (5076), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 5076 transitions. [2025-04-26 16:24:44,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1311 states and 5076 transitions. [2025-04-26 16:24:44,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:44,288 INFO L438 stractBuchiCegarLoop]: Abstraction has 1311 states and 5076 transitions. [2025-04-26 16:24:44,288 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:24:44,288 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1311 states and 5076 transitions. [2025-04-26 16:24:44,293 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:24:44,293 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:44,293 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:44,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:44,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:44,294 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[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[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-04-26 16:24:44,294 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-04-26 16:24:44,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1709124410, now seen corresponding path program 1 times [2025-04-26 16:24:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999780348] [2025-04-26 16:24:44,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:24:44,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:24:44,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:24:44,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:24:44,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 2 times [2025-04-26 16:24:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414865840] [2025-04-26 16:24:44,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:44,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:44,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:44,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:44,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:44,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1791047804, now seen corresponding path program 1 times [2025-04-26 16:24:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559961747] [2025-04-26 16:24:44,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:44,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:44,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:44,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:44,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,345 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:44,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:44,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:44,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:44,345 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:44,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:44,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:44,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:24:44,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:44,345 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:44,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:44,358 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:44,358 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:44,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,360 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-04-26 16:24:44,361 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-04-26 16:24:44,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:44,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:44,379 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-04-26 16:24:44,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,381 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-04-26 16:24:44,383 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-04-26 16:24:44,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:44,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:44,469 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:44,474 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-04-26 16:24:44,474 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:44,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:44,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:44,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:44,475 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:44,475 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,475 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:44,475 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:44,475 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:24:44,475 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:44,475 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:44,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:44,489 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:44,489 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:44,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,491 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-04-26 16:24:44,492 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-04-26 16:24:44,494 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-04-26 16:24:44,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:44,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:44,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:44,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:44,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:44,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:44,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:44,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:44,509 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:44,510 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,511 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-04-26 16:24:44,513 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-04-26 16:24:44,514 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:44,518 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-04-26 16:24:44,518 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:44,518 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:44,518 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 16:24:44,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:24:44,525 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:44,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:24:44,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:24:44,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:44,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:44,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:44,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:44,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:44,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:44,574 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-04-26 16:24:44,575 INFO L70 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, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,680 INFO L74 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, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4937 states and 17909 transitions. Complement of second has 7 states. [2025-04-26 16:24:44,681 INFO L140 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-04-26 16:24:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-26 16:24:44,682 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:24:44,682 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,682 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:24:44,682 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,682 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:24:44,682 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:44,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4937 states and 17909 transitions. [2025-04-26 16:24:44,717 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:24:44,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4937 states to 3802 states and 13410 transitions. [2025-04-26 16:24:44,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 696 [2025-04-26 16:24:44,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 895 [2025-04-26 16:24:44,754 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3802 states and 13410 transitions. [2025-04-26 16:24:44,754 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:44,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3802 states and 13410 transitions. [2025-04-26 16:24:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states and 13410 transitions. [2025-04-26 16:24:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2638. [2025-04-26 16:24:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 2638 states have (on average 3.8601213040181954) internal successors, (in total 10183), 2637 states have internal predecessors, (10183), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 10183 transitions. [2025-04-26 16:24:44,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2638 states and 10183 transitions. [2025-04-26 16:24:44,850 INFO L438 stractBuchiCegarLoop]: Abstraction has 2638 states and 10183 transitions. [2025-04-26 16:24:44,850 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:24:44,850 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2638 states and 10183 transitions. [2025-04-26 16:24:44,860 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:24:44,860 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:44,860 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:44,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:44,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:44,861 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-04-26 16:24:44,861 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-04-26 16:24:44,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1428802440, now seen corresponding path program 2 times [2025-04-26 16:24:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232658219] [2025-04-26 16:24:44,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:44,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:44,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:44,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:44,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 3 times [2025-04-26 16:24:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810039015] [2025-04-26 16:24:44,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:44,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:44,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:24:44,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:44,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:44,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1310392954, now seen corresponding path program 3 times [2025-04-26 16:24:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:44,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048532549] [2025-04-26 16:24:44,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:44,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 2 equivalence classes. [2025-04-26 16:24:44,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:24:44,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:24:44,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:44,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:24:44,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:24:44,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:44,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:44,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:44,898 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:44,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:44,899 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:44,899 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:44,899 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:44,899 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:44,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:44,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-04-26 16:24:44,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:44,899 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:44,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:44,912 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:44,912 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,916 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-04-26 16:24:44,918 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-04-26 16:24:44,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:44,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:44,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:44,941 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-04-26 16:24:44,942 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-04-26 16:24:44,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:44,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:45,016 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:45,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:24:45,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:45,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:45,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:45,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:45,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:45,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:45,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:45,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration8_Loop [2025-04-26 16:24:45,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:45,021 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:45,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:45,035 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:45,035 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:45,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,037 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-04-26 16:24:45,039 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-04-26 16:24:45,040 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-04-26 16:24:45,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:45,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:45,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:45,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:45,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:45,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:45,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:45,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:45,054 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:45,054 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:45,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,056 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-04-26 16:24:45,057 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-04-26 16:24:45,058 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:45,061 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-04-26 16:24:45,062 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:45,062 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:45,062 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 16:24:45,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:45,068 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:45,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:45,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:45,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:45,113 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-04-26 16:24:45,114 INFO L70 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, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,212 INFO L74 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, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8044 states and 29440 transitions. Complement of second has 7 states. [2025-04-26 16:24:45,213 INFO L140 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-04-26 16:24:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:24:45,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:24:45,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:45,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:24:45,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:45,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:24:45,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:45,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8044 states and 29440 transitions. [2025-04-26 16:24:45,296 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:24:45,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8044 states to 5525 states and 19915 transitions. [2025-04-26 16:24:45,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1039 [2025-04-26 16:24:45,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1063 [2025-04-26 16:24:45,380 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5525 states and 19915 transitions. [2025-04-26 16:24:45,380 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:45,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5525 states and 19915 transitions. [2025-04-26 16:24:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states and 19915 transitions. [2025-04-26 16:24:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 3280. [2025-04-26 16:24:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3280 states have (on average 3.8826219512195124) internal successors, (in total 12735), 3279 states have internal predecessors, (12735), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 12735 transitions. [2025-04-26 16:24:45,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3280 states and 12735 transitions. [2025-04-26 16:24:45,483 INFO L438 stractBuchiCegarLoop]: Abstraction has 3280 states and 12735 transitions. [2025-04-26 16:24:45,483 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:24:45,483 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3280 states and 12735 transitions. [2025-04-26 16:24:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 98 [2025-04-26 16:24:45,501 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:45,501 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:45,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:45,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:45,503 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[]" "[91] L53-->L55: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[107] L16-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[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]" "[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-04-26 16:24:45,503 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-04-26 16:24:45,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1790956664, now seen corresponding path program 4 times [2025-04-26 16:24:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:45,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014217794] [2025-04-26 16:24:45,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:24:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:45,507 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:24:45,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:45,510 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:24:45,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:45,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:45,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:45,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:45,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 4 times [2025-04-26 16:24:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:45,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027291800] [2025-04-26 16:24:45,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:24:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:45,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:24:45,516 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:45,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:24:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:45,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:45,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1172534726, now seen corresponding path program 5 times [2025-04-26 16:24:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:45,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912097649] [2025-04-26 16:24:45,518 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:24:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:45,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:24:45,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:45,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:24:45,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:45,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:45,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:45,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:45,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:45,544 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:45,544 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:45,544 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:45,544 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:45,544 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:45,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:45,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:45,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-04-26 16:24:45,544 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:45,544 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:45,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:45,561 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:45,561 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:45,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,563 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-04-26 16:24:45,564 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-04-26 16:24:45,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:45,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:45,583 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-04-26 16:24:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,585 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-04-26 16:24:45,586 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-04-26 16:24:45,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:45,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:45,672 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:45,677 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-04-26 16:24:45,677 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:45,677 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:45,677 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:45,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:45,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:45,677 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,677 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:45,677 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:45,677 INFO L132 ssoRankerPreferences]: Filename of dumped script: mixed_3.c.bpl_petrified1_Iteration9_Loop [2025-04-26 16:24:45,677 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:45,677 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:45,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:45,693 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:45,693 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:45,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,695 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-04-26 16:24:45,697 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-04-26 16:24:45,698 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-04-26 16:24:45,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:45,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:45,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:45,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:45,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:45,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:45,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:45,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:45,714 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:45,714 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:45,716 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-04-26 16:24:45,717 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-04-26 16:24:45,719 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:45,722 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-04-26 16:24:45,722 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:45,722 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:45,722 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = -1*x1 + 1*x2 Supporting invariants [] [2025-04-26 16:24:45,728 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-04-26 16:24:45,729 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:45,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:45,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:45,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,766 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:45,774 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-04-26 16:24:45,774 INFO L70 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,877 INFO L74 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6409 states and 23888 transitions. Complement of second has 7 states. [2025-04-26 16:24:45,877 INFO L140 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-04-26 16:24:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:24:45,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:24:45,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:45,878 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:45,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:45,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:45,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:45,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:45,923 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-04-26 16:24:45,923 INFO L70 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,978 INFO L74 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6409 states and 23888 transitions. Complement of second has 7 states. [2025-04-26 16:24:45,978 INFO L140 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-04-26 16:24:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:24:45,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:24:45,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:45,979 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:45,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:45,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:45,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:45,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:45,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:45,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:45,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:46,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:46,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:46,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:46,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:46,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:46,022 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-04-26 16:24:46,022 INFO L70 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:46,098 INFO L74 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, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8310 states and 30707 transitions. Complement of second has 6 states. [2025-04-26 16:24:46,098 INFO L140 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-04-26 16:24:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:24:46,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:24:46,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:46,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:24:46,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:46,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:24:46,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:46,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8310 states and 30707 transitions. [2025-04-26 16:24:46,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:46,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8310 states to 0 states and 0 transitions. [2025-04-26 16:24:46,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:46,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:46,154 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:46,154 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:46,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:46,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:46,154 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:46,155 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:24:46,155 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:46,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:46,155 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:46,198 INFO L201 PluginConnector]: Adding new model mixed_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:46 BoogieIcfgContainer [2025-04-26 16:24:46,198 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:46,199 INFO L158 Benchmark]: Toolchain (without parser) took 5810.73ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 86.0MB in the beginning and 159.8MB in the end (delta: -73.8MB). Peak memory consumption was 140.9MB. Max. memory is 8.0GB. [2025-04-26 16:24:46,199 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:46,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:46,199 INFO L158 Benchmark]: Boogie Preprocessor took 24.03ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:46,199 INFO L158 Benchmark]: RCFGBuilder took 188.53ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:46,199 INFO L158 Benchmark]: BuchiAutomizer took 5556.98ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 73.7MB in the beginning and 159.8MB in the end (delta: -86.1MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2025-04-26 16:24:46,200 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.23ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.21ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 84.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.03ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 188.53ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.9MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5556.98ms. Allocated memory was 159.4MB in the beginning and 272.6MB in the end (delta: 113.2MB). Free memory was 73.7MB in the beginning and 159.8MB in the end (delta: -86.1MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. 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: 56ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:46,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...