/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:00,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:00,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:00,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:00,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:00,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:00,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:00,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:00,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:00,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:00,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:00,648 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:00,648 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:00,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:00,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:00,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:00,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:00,650 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:00,651 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:00,651 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:01,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:01,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:01,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:01,050 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:01,050 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:01,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl [2025-04-26 16:54:01,053 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating-slowitp.bpl' [2025-04-26 16:54:01,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:01,076 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:01,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:01,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:01,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,116 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:01,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:01,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:01,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:01,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:01,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:01,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:01,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:01,190 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:01,191 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:01,191 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:01,191 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:01,192 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:54:01,227 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:01,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:01,344 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:01,344 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:01,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:01,383 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:01,383 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01 BoogieIcfgContainer [2025-04-26 16:54:01,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:01,384 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:01,384 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:01,391 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:01,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,391 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/2) ... [2025-04-26 16:54:01,392 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1834f8f8 and model type motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:01, skipping insertion in model container [2025-04-26 16:54:01,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,393 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01" (2/2) ... [2025-04-26 16:54:01,394 INFO L376 chiAutomizerObserver]: Analyzing ICFG motivating-slowitp.bpl [2025-04-26 16:54:01,453 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:54:01,492 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:01,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:54:01,566 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:54:01,568 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:01,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-26 16:54:01,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:54:01,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 16:54:01,577 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 16:54:01,585 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:01,788 WARN L140 AmpleReduction]: Number of pruned transitions: 130 [2025-04-26 16:54:01,788 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:01,788 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 16:54:01,788 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 16:54:01,788 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:74 [2025-04-26 16:54:01,789 WARN L145 AmpleReduction]: Times succ was already a loop node:67 [2025-04-26 16:54:01,789 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:10 [2025-04-26 16:54:01,789 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:01,791 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:54:01,797 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:01,797 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:01,797 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:01,797 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:01,797 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:01,797 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:01,797 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:01,797 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:01,799 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:54:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 91 [2025-04-26 16:54:01,813 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:01,813 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:01,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:01,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:01,818 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:01,818 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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:54:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 91 [2025-04-26 16:54:01,823 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:01,823 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:01,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:01,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:01,827 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" [2025-04-26 16:54:01,828 INFO L754 eck$LassoCheckResult]: Loop: "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" [2025-04-26 16:54:01,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 116929, now seen corresponding path program 1 times [2025-04-26 16:54:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674534271] [2025-04-26 16:54:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:01,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:01,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:54:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676689132] [2025-04-26 16:54:01,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:01,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:01,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:01,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 112371715, now seen corresponding path program 1 times [2025-04-26 16:54:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757117086] [2025-04-26 16:54:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:01,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:01,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:01,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:01,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,110 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:02,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:02,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:02,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:02,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:02,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:02,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:02,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:02,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:02,113 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:02,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,251 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:02,254 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:02,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,257 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:54:02,261 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:54:02,261 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:54:02,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:02,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:02,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:02,281 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,287 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:54:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,290 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:54:02,290 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:54:02,291 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:54:02,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:02,334 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:02,334 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:02,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,337 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:54:02,340 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:54:02,341 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:02,358 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:54:02,359 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:02,359 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:02,360 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_i, N) = -1*thread1Thread1of1ForFork1_i + 1*N Supporting invariants [] [2025-04-26 16:54:02,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:02,375 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:02,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:02,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:02,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,433 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,460 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:54:02,477 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:54:02,478 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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) 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:54:02,603 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 135 states, 133 states have (on average 1.9248120300751879) internal successors, (in total 256), 134 states have internal predecessors, (256), 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). 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 315 states and 604 transitions. Complement of second has 6 states. [2025-04-26 16:54:02,604 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:54:02,607 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:54:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 16:54:02,613 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:54:02,615 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,615 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:54:02,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:54:02,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 604 transitions. [2025-04-26 16:54:02,625 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 16:54:02,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 154 states and 288 transitions. [2025-04-26 16:54:02,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-04-26 16:54:02,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-04-26 16:54:02,636 INFO L74 IsDeterministic]: Start isDeterministic. Operand 154 states and 288 transitions. [2025-04-26 16:54:02,637 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:02,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 288 transitions. [2025-04-26 16:54:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 288 transitions. [2025-04-26 16:54:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2025-04-26 16:54:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.9022556390977443) internal successors, (in total 253), 132 states have internal predecessors, (253), 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:54:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 253 transitions. [2025-04-26 16:54:02,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 253 transitions. [2025-04-26 16:54:02,668 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 253 transitions. [2025-04-26 16:54:02,669 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:02,669 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 253 transitions. [2025-04-26 16:54:02,670 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 16:54:02,673 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:02,673 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:02,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:02,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:02,673 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[93] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:54:02,674 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 16:54:02,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1885397264, now seen corresponding path program 1 times [2025-04-26 16:54:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056878826] [2025-04-26 16:54:02,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,748 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:54:02,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:02,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056878826] [2025-04-26 16:54:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056878826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:02,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031151410] [2025-04-26 16:54:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:02,752 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:02,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 1 times [2025-04-26 16:54:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052672002] [2025-04-26 16:54:02,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:02,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:02,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:02,904 INFO L87 Difference]: Start difference. First operand 133 states and 253 transitions. cyclomatic complexity: 151 Second operand has 4 states, 4 states have (on average 2.0) 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:54:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:02,963 INFO L93 Difference]: Finished difference Result 133 states and 252 transitions. [2025-04-26 16:54:02,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 252 transitions. [2025-04-26 16:54:02,965 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 16:54:02,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 252 transitions. [2025-04-26 16:54:02,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-04-26 16:54:02,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 16:54:02,966 INFO L74 IsDeterministic]: Start isDeterministic. Operand 133 states and 252 transitions. [2025-04-26 16:54:02,966 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:02,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 16:54:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 252 transitions. [2025-04-26 16:54:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-04-26 16:54:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.894736842105263) internal successors, (in total 252), 132 states have internal predecessors, (252), 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:54:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 252 transitions. [2025-04-26 16:54:02,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 16:54:02,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:02,975 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 252 transitions. [2025-04-26 16:54:02,975 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:02,975 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 252 transitions. [2025-04-26 16:54:02,976 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 39 [2025-04-26 16:54:02,976 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:02,976 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:02,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:02,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:02,977 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:54:02,977 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 16:54:02,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1634770767, now seen corresponding path program 1 times [2025-04-26 16:54:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97719068] [2025-04-26 16:54:02,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:02,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 2 times [2025-04-26 16:54:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913850966] [2025-04-26 16:54:03,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:03,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:03,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:03,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:03,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 943326387, now seen corresponding path program 1 times [2025-04-26 16:54:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323480713] [2025-04-26 16:54:03,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:03,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:03,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:03,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:03,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,270 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:03,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:03,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:03,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:03,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:03,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:03,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:03,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:03,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:03,271 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:03,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,698 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:03,698 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,700 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:54:03,702 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:54:03,703 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:54:03,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,719 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,728 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:54:03,729 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:54:03,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,741 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:03,741 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 16:54:03,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,772 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-04-26 16:54:03,772 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 16:54:03,835 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,843 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:54:03,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,845 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:54:03,848 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:54:03,848 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:54:03,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:03,874 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:03,875 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:03,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,877 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:54:03,880 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:54:03,880 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:03,899 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:54:03,899 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:03,899 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:03,899 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 16:54:03,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,906 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:03,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:03,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:03,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:03,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:03,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,969 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:54:03,970 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:54:03,970 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 252 transitions. cyclomatic complexity: 150 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:54:04,054 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 252 transitions. cyclomatic complexity: 150. 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 315 states and 602 transitions. Complement of second has 7 states. [2025-04-26 16:54:04,054 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:54:04,055 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:54:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:54:04,056 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:54:04,056 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:04,056 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:54:04,056 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:04,056 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:54:04,056 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:04,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 602 transitions. [2025-04-26 16:54:04,059 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 65 [2025-04-26 16:54:04,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 228 states and 413 transitions. [2025-04-26 16:54:04,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-04-26 16:54:04,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2025-04-26 16:54:04,062 INFO L74 IsDeterministic]: Start isDeterministic. Operand 228 states and 413 transitions. [2025-04-26 16:54:04,062 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:04,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 228 states and 413 transitions. [2025-04-26 16:54:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 413 transitions. [2025-04-26 16:54:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 180. [2025-04-26 16:54:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.8611111111111112) internal successors, (in total 335), 179 states have internal predecessors, (335), 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:54:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 335 transitions. [2025-04-26 16:54:04,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 335 transitions. [2025-04-26 16:54:04,075 INFO L438 stractBuchiCegarLoop]: Abstraction has 180 states and 335 transitions. [2025-04-26 16:54:04,075 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:04,075 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 335 transitions. [2025-04-26 16:54:04,076 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 51 [2025-04-26 16:54:04,076 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:04,076 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:04,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:04,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:04,077 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" [2025-04-26 16:54:04,077 INFO L754 eck$LassoCheckResult]: Loop: "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[100] L52-->L52-1: Formula: (and (let ((.cse0 (select v_A_15 v_thread2Thread1of1ForFork2_j_7))) (or (and (= v_thread2_cnt_30 (+ v_thread2Thread1of1ForFork2_cnt_3 1)) (< 0 .cse0)) (and (<= .cse0 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_3)))) (let ((.cse1 (select v_B_13 v_thread2Thread1of1ForFork2_j_7))) (or (and (<= .cse1 0) (= v_thread2_cnt_30 v_thread2Thread1of1ForFork2_cnt_4)) (and (< 0 .cse1) (= v_thread2Thread1of1ForFork2_cnt_4 (+ v_thread2_cnt_30 1))))) (= (+ v_thread2Thread1of1ForFork2_j_7 1) v_thread2Thread1of1ForFork2_j_8)) InVars {A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_7, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_3, B=v_B_13} OutVars{A=v_A_15, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_8, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_4, B=v_B_13} AuxVars[v_thread2_cnt_30] AssignedVars[thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_cnt]" [2025-04-26 16:54:04,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1634770917, now seen corresponding path program 2 times [2025-04-26 16:54:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615591061] [2025-04-26 16:54:04,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:04,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:04,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:04,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:04,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:04,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash 4099, now seen corresponding path program 3 times [2025-04-26 16:54:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037860293] [2025-04-26 16:54:04,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:04,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:04,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:04,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:04,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:04,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 943182237, now seen corresponding path program 2 times [2025-04-26 16:54:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335781815] [2025-04-26 16:54:04,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:04,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:04,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:04,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:04,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,373 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:04,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:04,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:04,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:04,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:04,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:04,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:04,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:04,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:04,373 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:04,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,764 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:04,764 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:04,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,766 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:54:04,768 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:54:04,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:54:04,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:04,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:04,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:04,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:04,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:04,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:04,785 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:04,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,794 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:54:04,795 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:54:04,797 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:54:04,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:04,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:04,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:04,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:04,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:04,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:04,811 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:04,818 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:54:04,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,820 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:54:04,822 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:54:04,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:04,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:04,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:04,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:04,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:04,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:04,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:04,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:04,857 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:04,857 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:54:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,859 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:54:04,861 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:54:04,862 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:04,879 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:54:04,879 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:04,879 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:04,879 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_j, N) = -1*thread2Thread1of1ForFork2_j + 1*N Supporting invariants [] [2025-04-26 16:54:04,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:54:04,886 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:04,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:04,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:04,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:04,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:04,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:04,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:04,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:04,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:04,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:04,935 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:54:04,935 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:54:04,936 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 180 states and 335 transitions. cyclomatic complexity: 198 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:54:05,008 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 180 states and 335 transitions. cyclomatic complexity: 198. 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 357 states and 686 transitions. Complement of second has 6 states. [2025-04-26 16:54:05,009 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:54:05,009 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:54:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:54:05,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:54:05,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:54:05,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,010 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:54:05,010 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 686 transitions. [2025-04-26 16:54:05,014 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 32 [2025-04-26 16:54:05,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 232 states and 423 transitions. [2025-04-26 16:54:05,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:54:05,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2025-04-26 16:54:05,016 INFO L74 IsDeterministic]: Start isDeterministic. Operand 232 states and 423 transitions. [2025-04-26 16:54:05,016 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:05,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 232 states and 423 transitions. [2025-04-26 16:54:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 423 transitions. [2025-04-26 16:54:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 173. [2025-04-26 16:54:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.8901734104046244) internal successors, (in total 327), 172 states have internal predecessors, (327), 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:54:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 327 transitions. [2025-04-26 16:54:05,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 327 transitions. [2025-04-26 16:54:05,026 INFO L438 stractBuchiCegarLoop]: Abstraction has 173 states and 327 transitions. [2025-04-26 16:54:05,026 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:05,026 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 327 transitions. [2025-04-26 16:54:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:05,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:05,027 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:05,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:05,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:05,028 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:54:05,028 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 16:54:05,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash -821652726, now seen corresponding path program 1 times [2025-04-26 16:54:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663058108] [2025-04-26 16:54:05,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:05,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:05,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:05,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:05,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 16:54:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841631647] [2025-04-26 16:54:05,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:05,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:05,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:05,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:05,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 665716076, now seen corresponding path program 1 times [2025-04-26 16:54:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88226761] [2025-04-26 16:54:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:05,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:05,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:05,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:05,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,233 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:05,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:05,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:05,233 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:05,233 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:05,233 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,233 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:05,233 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:05,233 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:54:05,233 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:05,233 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:05,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,426 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:05,426 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,428 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,430 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:54:05,431 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:54:05,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,445 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,453 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:54:05,453 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:54:05,456 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:54:05,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,470 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,478 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:54:05,479 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:54:05,481 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:54:05,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,495 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,503 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:54:05,506 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:54:05,506 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:54:05,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,529 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:54:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,531 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:54:05,532 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:54:05,534 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:54:05,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,548 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,556 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:54:05,557 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:54:05,559 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:54:05,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,576 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,585 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:54:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,589 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:54:05,589 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:54:05,590 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:54:05,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,611 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:54:05,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,613 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:54:05,617 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:54:05,618 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:54:05,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,634 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,643 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:54:05,644 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:54:05,644 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:54:05,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,660 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,665 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:54:05,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,667 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:54:05,669 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:54:05,669 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:54:05,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:05,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:05,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:05,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,693 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:54:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,695 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:54:05,697 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:54:05,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:54:05,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:05,729 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:54:05,729 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:05,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,732 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:54:05,733 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:54:05,733 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:05,749 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:54:05,750 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:05,750 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:05,750 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k) = -2*thread3Thread1of1ForFork0_k + 1 Supporting invariants [-1*N + 1 >= 0] [2025-04-26 16:54:05,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,759 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:05,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:05,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:05,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:05,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:05,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:05,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:05,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:05,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:05,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:05,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:05,879 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:54:05,880 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-04-26 16:54:05,880 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 327 transitions. cyclomatic complexity: 188 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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:54:05,994 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 327 transitions. cyclomatic complexity: 188. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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 316 states and 550 transitions. Complement of second has 11 states. [2025-04-26 16:54:05,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 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:54:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2025-04-26 16:54:05,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:54:05,995 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,995 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:05,995 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,995 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 55 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:54:05,995 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 550 transitions. [2025-04-26 16:54:05,997 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:05,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 216 states and 386 transitions. [2025-04-26 16:54:05,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-04-26 16:54:05,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-04-26 16:54:05,998 INFO L74 IsDeterministic]: Start isDeterministic. Operand 216 states and 386 transitions. [2025-04-26 16:54:05,998 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:05,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 216 states and 386 transitions. [2025-04-26 16:54:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 386 transitions. [2025-04-26 16:54:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2025-04-26 16:54:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.8876404494382022) internal successors, (in total 336), 177 states have internal predecessors, (336), 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:54:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 336 transitions. [2025-04-26 16:54:06,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 336 transitions. [2025-04-26 16:54:06,003 INFO L438 stractBuchiCegarLoop]: Abstraction has 178 states and 336 transitions. [2025-04-26 16:54:06,003 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:06,003 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 336 transitions. [2025-04-26 16:54:06,004 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:06,005 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:06,005 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:06,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:06,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:06,005 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[97] L52-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork2_j_3) InVars {N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} OutVars{N=v_N_3, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" [2025-04-26 16:54:06,005 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 16:54:06,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash -810279667, now seen corresponding path program 1 times [2025-04-26 16:54:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331570395] [2025-04-26 16:54:06,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:06,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:06,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,053 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:54:06,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:06,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331570395] [2025-04-26 16:54:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331570395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:54:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888769450] [2025-04-26 16:54:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:06,054 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:06,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 2 times [2025-04-26 16:54:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308646297] [2025-04-26 16:54:06,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:06,087 INFO L87 Difference]: Start difference. First operand 178 states and 336 transitions. cyclomatic complexity: 192 Second operand has 4 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:54:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:06,125 INFO L93 Difference]: Finished difference Result 272 states and 509 transitions. [2025-04-26 16:54:06,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 509 transitions. [2025-04-26 16:54:06,127 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 26 [2025-04-26 16:54:06,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 272 states and 509 transitions. [2025-04-26 16:54:06,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 16:54:06,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-04-26 16:54:06,130 INFO L74 IsDeterministic]: Start isDeterministic. Operand 272 states and 509 transitions. [2025-04-26 16:54:06,131 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:06,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 272 states and 509 transitions. [2025-04-26 16:54:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 509 transitions. [2025-04-26 16:54:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 195. [2025-04-26 16:54:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.8717948717948718) internal successors, (in total 365), 194 states have internal predecessors, (365), 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:54:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 365 transitions. [2025-04-26 16:54:06,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 365 transitions. [2025-04-26 16:54:06,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:06,143 INFO L438 stractBuchiCegarLoop]: Abstraction has 195 states and 365 transitions. [2025-04-26 16:54:06,143 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:06,143 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 365 transitions. [2025-04-26 16:54:06,144 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:06,144 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:06,144 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:06,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:06,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:06,145 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:06,145 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 16:54:06,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash -810279666, now seen corresponding path program 2 times [2025-04-26 16:54:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276761831] [2025-04-26 16:54:06,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:06,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:06,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:06,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:06,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 3 times [2025-04-26 16:54:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473862550] [2025-04-26 16:54:06,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:06,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1289675152, now seen corresponding path program 2 times [2025-04-26 16:54:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354023946] [2025-04-26 16:54:06,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:06,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:06,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:06,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:06,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:06,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,319 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:06,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:06,319 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:06,319 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:06,319 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:06,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:06,319 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:06,319 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:06,319 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:06,319 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:06,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:06,493 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:06,493 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,496 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:54:06,497 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:54:06,497 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:54:06,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,511 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,516 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:54:06,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,518 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:54:06,519 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:54:06,519 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:54:06,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,533 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,541 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:54:06,543 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:54:06,544 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:54:06,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,558 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,567 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:54:06,568 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:54:06,569 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:54:06,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,594 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:54:06,595 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:54:06,596 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:54:06,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,618 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:54:06,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,621 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:54:06,622 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:54:06,622 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:54:06,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,634 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:06,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,636 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:06,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,640 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:54:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,650 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:54:06,651 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:54:06,652 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:54:06,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,675 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:54:06,675 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:54:06,677 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:54:06,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,692 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,697 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:54:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,699 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:54:06,700 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:54:06,701 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:54:06,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,714 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,720 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:54:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,722 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:54:06,723 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:54:06,723 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:54:06,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,738 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:54:06,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,746 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:54:06,747 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:54:06,748 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:54:06,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:06,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:06,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:06,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,765 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:54:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,767 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:54:06,769 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:54:06,770 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:54:06,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:06,797 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:06,797 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,799 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:54:06,800 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:54:06,800 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:06,818 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:54:06,818 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:06,819 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:06,819 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:54:06,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:54:06,826 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:06,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:06,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:06,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,873 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:54:06,874 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:54:06,874 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 365 transitions. cyclomatic complexity: 206 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:54:06,933 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 365 transitions. cyclomatic complexity: 206. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 630 states and 1200 transitions. Complement of second has 7 states. [2025-04-26 16:54:06,933 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:54:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:54:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:54:06,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:54:06,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:06,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:54:06,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1200 transitions. [2025-04-26 16:54:06,939 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:06,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 184 states and 334 transitions. [2025-04-26 16:54:06,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-04-26 16:54:06,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-04-26 16:54:06,941 INFO L74 IsDeterministic]: Start isDeterministic. Operand 184 states and 334 transitions. [2025-04-26 16:54:06,941 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:06,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 184 states and 334 transitions. [2025-04-26 16:54:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 334 transitions. [2025-04-26 16:54:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2025-04-26 16:54:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.8439306358381502) internal successors, (in total 319), 172 states have internal predecessors, (319), 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:54:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 319 transitions. [2025-04-26 16:54:06,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 319 transitions. [2025-04-26 16:54:06,947 INFO L438 stractBuchiCegarLoop]: Abstraction has 173 states and 319 transitions. [2025-04-26 16:54:06,947 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:06,947 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 319 transitions. [2025-04-26 16:54:06,948 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:54:06,948 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:06,948 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:06,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:06,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:06,950 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L18: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[]" "[111] L18-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_12, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i, thread1Thread1of1ForFork1_thidvar0]" "[90] $Ultimate##0-->L36-1: Formula: (= v_thread1Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_i]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[114] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_12, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_j, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_cnt]" "[95] $Ultimate##0-->L50: Formula: (= v_thread2Thread1of1ForFork2_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_cnt=v_thread2Thread1of1ForFork2_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_cnt]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[96] L50-->L52-1: Formula: (= v_thread2Thread1of1ForFork2_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_j]" "[92] L36-1-->L36: Formula: (< v_thread1Thread1of1ForFork1_i_5 v_N_1) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[98] L52-1-->L52: Formula: (< v_thread2Thread1of1ForFork2_j_5 v_N_4) InVars {N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} OutVars{N=v_N_4, thread2Thread1of1ForFork2_j=v_thread2Thread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[94] L36-->L36-1: Formula: (and (= (store v_A_8 v_thread1Thread1of1ForFork1_i_7 (let ((.cse0 (select v_A_8 v_thread1Thread1of1ForFork1_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_7) (= (+ v_thread1Thread1of1ForFork1_i_7 1) v_thread1Thread1of1ForFork1_i_8)) InVars {A=v_A_8, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_7} OutVars{A=v_A_7, thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_8} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork1_i]" "[91] L36-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork1_i_3) InVars {thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork1_i=v_thread1Thread1of1ForFork1_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[108] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_12, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[101] $Ultimate##0-->L72-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:54:06,950 INFO L754 eck$LassoCheckResult]: Loop: "[103] L72-1-->L72: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[105] L72-->L72-1: Formula: (and (= v_thread3Thread1of1ForFork0_k_8 (+ v_thread3Thread1of1ForFork0_k_7 1)) (= (store v_B_8 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_7)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_8} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_8, B=v_B_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, B]" [2025-04-26 16:54:06,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 693918694, now seen corresponding path program 3 times [2025-04-26 16:54:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772531485] [2025-04-26 16:54:06,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:06,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:06,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:06,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:06,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 4 times [2025-04-26 16:54:06,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854219655] [2025-04-26 16:54:06,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,977 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:54:06,979 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:54:06,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:06,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:06,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:06,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:06,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1135937352, now seen corresponding path program 3 times [2025-04-26 16:54:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:06,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252530046] [2025-04-26 16:54:06,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:06,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:06,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:06,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:06,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:06,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:07,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:07,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:07,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:07,206 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:07,207 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:07,207 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:07,207 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:07,207 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:07,207 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:07,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:07,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:07,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating-slowitp.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:54:07,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:07,207 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:07,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:07,559 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:07,559 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:07,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:07,561 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:54:07,562 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:54:07,563 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:54:07,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:07,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:07,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:07,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:07,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:07,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:07,577 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:07,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:54:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:07,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:54:07,585 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:54:07,586 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:54:07,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:07,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:07,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:07,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:07,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:07,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:07,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:07,612 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:07,612 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:07,614 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:54:07,615 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:54:07,616 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:07,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:54:07,633 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:07,633 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:07,633 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:54:07,639 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:54:07,641 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:07,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:07,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:07,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:07,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:07,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:07,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:07,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:07,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:07,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:07,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:07,693 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:54:07,693 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:54:07,693 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 319 transitions. cyclomatic complexity: 181 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:54:07,743 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 319 transitions. cyclomatic complexity: 181. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 338 states and 630 transitions. Complement of second has 6 states. [2025-04-26 16:54:07,746 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:54:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:54:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:54:07,747 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:07,748 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,748 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:54:07,748 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,748 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:54:07,748 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 630 transitions. [2025-04-26 16:54:07,751 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:07,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:07,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:07,751 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:07,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:54:07,751 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:07,751 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:07,751 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:07,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:07,763 INFO L201 PluginConnector]: Adding new model motivating-slowitp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:07 BoogieIcfgContainer [2025-04-26 16:54:07,764 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:07,764 INFO L158 Benchmark]: Toolchain (without parser) took 6689.44ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.1MB in the beginning and 81.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2025-04-26 16:54:07,765 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.02ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:07,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:07,765 INFO L158 Benchmark]: Boogie Preprocessor took 22.79ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 978.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:07,765 INFO L158 Benchmark]: RCFGBuilder took 240.59ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 72.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:07,765 INFO L158 Benchmark]: BuchiAutomizer took 6379.72ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.7MB in the beginning and 81.8MB in the end (delta: -9.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:07,766 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 1.02ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.79ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 84.1MB in the end (delta: 978.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 240.59ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 72.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6379.72ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.7MB in the beginning and 81.8MB in the end (delta: -9.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 117 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital105 mio100 ax100 hnf100 lsp187 ukn33 mio100 lsp99 div100 bol100 ite100 ukn100 eq149 hnf96 smp86 dnf253 smp57 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 109ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 301, Number of transitions in reduction automaton: 256, Number of states in reduction automaton: 135, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function k * -2 + 1 and consists of 8 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:07,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...