/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/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:58,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:59,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:59,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:59,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:59,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:59,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:59,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:59,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:59,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:59,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:59,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:59,057 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:59,057 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:59,057 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:59,057 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:59,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:59,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:59,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:59,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:59,059 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:59,060 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:59,060 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:59,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:59,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:59,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:59,291 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:59,291 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:59,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl [2025-04-26 18:39:59,294 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x6.wvr.bpl' [2025-04-26 18:39:59,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:59,311 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:59,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:59,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:59,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:59,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,347 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:59,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:59,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:59,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:59,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:59,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:59,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:59,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:59,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:59,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/1) ... [2025-04-26 18:39:59,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,405 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 18:39:59,408 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 18:39:59,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:59,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:59,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:59,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:59,429 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:59,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:59,430 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:39:59,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:39:59,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:39:59,430 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 18:39:59,466 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:59,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:59,575 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:59,575 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:59,583 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:59,583 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:59,584 INFO L201 PluginConnector]: Adding new model exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:59 BoogieIcfgContainer [2025-04-26 18:39:59,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:59,585 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:59,585 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:59,591 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:59,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:59,591 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:59" (1/2) ... [2025-04-26 18:39:59,592 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46c31f85 and model type exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:59, skipping insertion in model container [2025-04-26 18:39:59,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:59,596 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:59" (2/2) ... [2025-04-26 18:39:59,597 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp2x6.wvr.bpl [2025-04-26 18:39:59,648 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:39:59,683 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:59,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:59,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,685 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 18:39:59,687 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 18:39:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 126 flow [2025-04-26 18:39:59,763 INFO L116 PetriNetUnfolderBase]: 4/41 cut-off events. [2025-04-26 18:39:59,765 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:39:59,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 4/41 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-26 18:39:59,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 49 transitions, 126 flow [2025-04-26 18:39:59,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 106 flow [2025-04-26 18:39:59,771 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 50 places, 41 transitions, 106 flow [2025-04-26 18:39:59,773 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 41 transitions, 106 flow [2025-04-26 18:39:59,935 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (in total 12677), 3205 states have internal predecessors, (12677), 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 18:39:59,946 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 3206 states, 3204 states have (on average 3.956616729088639) internal successors, (in total 12677), 3205 states have internal predecessors, (12677), 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 18:39:59,950 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:00,450 WARN L140 AmpleReduction]: Number of pruned transitions: 7083 [2025-04-26 18:40:00,450 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:00,450 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 627 [2025-04-26 18:40:00,450 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 18:40:00,450 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2541 [2025-04-26 18:40:00,450 WARN L145 AmpleReduction]: Times succ was already a loop node:217 [2025-04-26 18:40:00,450 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1544 [2025-04-26 18:40:00,451 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:00,457 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3206 states, 3204 states have (on average 1.7459425717852683) internal successors, (in total 5594), 3205 states have internal predecessors, (5594), 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 18:40:00,463 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:00,463 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:00,463 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:00,463 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:00,463 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:00,463 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:00,463 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:00,463 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:00,470 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3206 states, 3204 states have (on average 1.7459425717852683) internal successors, (in total 5594), 3205 states have internal predecessors, (5594), 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 18:40:00,537 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 3155 [2025-04-26 18:40:00,537 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:00,537 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:00,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:00,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:00,540 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:00,544 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3206 states, 3204 states have (on average 1.7459425717852683) internal successors, (in total 5594), 3205 states have internal predecessors, (5594), 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 18:40:00,573 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 3155 [2025-04-26 18:40:00,574 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:00,574 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:00,574 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:00,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:00,579 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:00,579 INFO L754 eck$LassoCheckResult]: Loop: "[95] L18-->L19: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[97] L19-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[98] L20-->L21: Formula: (= v_x1_4 (* v_x1_5 2)) InVars {x1=v_x1_5} OutVars{x1=v_x1_4} AuxVars[] AssignedVars[x1]" "[99] L21-->L22: Formula: (= v_x1_6 (* v_x1_7 2)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[100] L22-->L18: Formula: (= (* v_x1_9 2) v_x1_8) InVars {x1=v_x1_9} OutVars{x1=v_x1_8} AuxVars[] AssignedVars[x1]" [2025-04-26 18:40:00,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 3751, now seen corresponding path program 1 times [2025-04-26 18:40:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615911390] [2025-04-26 18:40:00,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 119350720, now seen corresponding path program 1 times [2025-04-26 18:40:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063030999] [2025-04-26 18:40:00,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:00,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:00,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 104484570, now seen corresponding path program 1 times [2025-04-26 18:40:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054302093] [2025-04-26 18:40:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:00,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,863 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:00,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:00,864 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:00,864 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:00,864 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:00,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:00,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:00,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:00,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:00,865 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:00,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,945 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:00,946 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,949 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 18:40:00,953 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 18:40:00,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,967 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:00,968 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:00,974 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 18:40:00,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,976 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 18:40:00,977 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 18:40:00,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,003 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 18:40:01,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,023 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 18:40:01,024 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 18:40:01,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:01,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,106 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:01,111 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 18:40:01,111 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:01,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:01,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:01,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:01,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:01,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:01,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:01,111 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:01,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:01,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:01,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,181 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:01,184 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:01,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,187 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 18:40:01,189 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 18:40:01,190 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 18:40:01,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:01,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,224 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 18:40:01,226 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 18:40:01,226 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 18:40:01,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:01,253 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:01,253 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:01,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,256 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 18:40:01,258 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 18:40:01,259 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:01,277 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 18:40:01,278 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:01,278 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:01,278 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -1*x1 + 1*n Supporting invariants [15*x1 - 2 >= 0] [2025-04-26 18:40:01,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:40:01,291 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:01,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:01,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:01,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:01,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:01,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:01,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:01,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:01,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:01,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:01,357 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 18:40:01,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:01,471 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 18:40:01,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-04-26 18:40:01,496 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3206 states, 3204 states have (on average 1.7459425717852683) internal successors, (in total 5594), 3205 states have internal predecessors, (5594), 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 7 states, 7 states have (on average 1.0) internal successors, (in total 7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,710 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3206 states, 3204 states have (on average 1.7459425717852683) internal successors, (in total 5594), 3205 states have internal predecessors, (5594), 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 7 states, 7 states have (on average 1.0) internal successors, (in total 7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6335 states and 11113 transitions. Complement of second has 8 states. [2025-04-26 18:40:01,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.0) internal successors, (in total 7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-04-26 18:40:01,719 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 90 transitions. Stem has 2 letters. Loop has 5 letters. [2025-04-26 18:40:01,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 90 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 18:40:01,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 90 transitions. Stem has 2 letters. Loop has 10 letters. [2025-04-26 18:40:01,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6335 states and 11113 transitions. [2025-04-26 18:40:01,774 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 1155 [2025-04-26 18:40:01,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6335 states to 4621 states and 7872 transitions. [2025-04-26 18:40:01,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2112 [2025-04-26 18:40:01,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2583 [2025-04-26 18:40:01,827 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4621 states and 7872 transitions. [2025-04-26 18:40:01,827 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:01,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4621 states and 7872 transitions. [2025-04-26 18:40:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states and 7872 transitions. [2025-04-26 18:40:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4464. [2025-04-26 18:40:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 4464 states have (on average 1.7282706093189963) internal successors, (in total 7715), 4463 states have internal predecessors, (7715), 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 18:40:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 7715 transitions. [2025-04-26 18:40:02,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4464 states and 7715 transitions. [2025-04-26 18:40:02,008 INFO L438 stractBuchiCegarLoop]: Abstraction has 4464 states and 7715 transitions. [2025-04-26 18:40:02,009 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:02,009 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4464 states and 7715 transitions. [2025-04-26 18:40:02,027 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 1155 [2025-04-26 18:40:02,028 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,028 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:02,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:02,028 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:40:02,028 INFO L754 eck$LassoCheckResult]: Loop: "[102] L29-->L30: Formula: (< v_x2_4 v_n_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[104] L30-->L31: Formula: (= (* v_x2_6 2) v_x2_5) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[105] L31-->L32: Formula: (= v_x2_7 (* v_x2_8 2)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[106] L32-->L33: Formula: (= v_x2_9 (* 2 v_x2_10)) InVars {x2=v_x2_10} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[x2]" "[107] L33-->L29: Formula: (= v_x2_1 (* v_x2_2 2)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:02,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 111839478, now seen corresponding path program 1 times [2025-04-26 18:40:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592645347] [2025-04-26 18:40:02,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 126030855, now seen corresponding path program 1 times [2025-04-26 18:40:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846920735] [2025-04-26 18:40:02,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1346427954, now seen corresponding path program 1 times [2025-04-26 18:40:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184017330] [2025-04-26 18:40:02,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:02,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:02,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,135 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 18:40:02,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:02,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184017330] [2025-04-26 18:40:02,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184017330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:02,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597657346] [2025-04-26 18:40:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:02,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:02,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:02,163 INFO L87 Difference]: Start difference. First operand 4464 states and 7715 transitions. cyclomatic complexity: 3358 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:40:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:02,253 INFO L93 Difference]: Finished difference Result 4617 states and 7928 transitions. [2025-04-26 18:40:02,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4617 states and 7928 transitions. [2025-04-26 18:40:02,278 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 1300 [2025-04-26 18:40:02,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4617 states to 4617 states and 7928 transitions. [2025-04-26 18:40:02,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2578 [2025-04-26 18:40:02,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2578 [2025-04-26 18:40:02,307 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4617 states and 7928 transitions. [2025-04-26 18:40:02,307 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:02,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4617 states and 7928 transitions. [2025-04-26 18:40:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states and 7928 transitions. [2025-04-26 18:40:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 4467. [2025-04-26 18:40:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4467 states, 4467 states have (on average 1.7277815088426236) internal successors, (in total 7718), 4466 states have internal predecessors, (7718), 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 18:40:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 7718 transitions. [2025-04-26 18:40:02,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4467 states and 7718 transitions. [2025-04-26 18:40:02,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:02,427 INFO L438 stractBuchiCegarLoop]: Abstraction has 4467 states and 7718 transitions. [2025-04-26 18:40:02,427 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:02,427 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4467 states and 7718 transitions. [2025-04-26 18:40:02,444 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 1155 [2025-04-26 18:40:02,444 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,444 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:02,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:02,445 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[101] L29-->thread2FINAL: Formula: (<= v_n_3 v_x2_3) InVars {x2=v_x2_3, n=v_n_3} OutVars{x2=v_x2_3, n=v_n_3} AuxVars[] AssignedVars[]" "[103] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L64-->L40: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:40:02,445 INFO L754 eck$LassoCheckResult]: Loop: "[109] L40-->L41: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L41-->L42: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[112] L42-->L43: Formula: (= (* v_x3_7 2) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[113] L43-->L44: Formula: (= v_x3_8 (* v_x3_9 2)) InVars {x3=v_x3_9} OutVars{x3=v_x3_8} AuxVars[] AssignedVars[x3]" "[114] L44-->L40: Formula: (= (* 2 v_x3_11) v_x3_10) InVars {x3=v_x3_11} OutVars{x3=v_x3_10} AuxVars[] AssignedVars[x3]" [2025-04-26 18:40:02,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1084632214, now seen corresponding path program 1 times [2025-04-26 18:40:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572835956] [2025-04-26 18:40:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:02,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:02,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:02,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 132710990, now seen corresponding path program 1 times [2025-04-26 18:40:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169221097] [2025-04-26 18:40:02,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:02,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:02,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1175983995, now seen corresponding path program 1 times [2025-04-26 18:40:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320083269] [2025-04-26 18:40:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:02,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:02,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:02,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,588 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:02,588 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:02,588 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:02,588 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:02,588 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:02,588 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,588 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:02,588 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:02,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:02,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:02,589 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:02,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,687 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:02,687 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:02,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,691 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 18:40:02,691 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 18:40:02,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,703 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:02,704 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:02,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,712 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 18:40:02,713 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 18:40:02,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,746 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 18:40:02,748 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 18:40:02,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:02,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,877 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:02,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:02,884 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:02,884 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:02,884 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:02,884 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:02,884 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:02,884 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:02,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:02,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:02,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:02,885 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:02,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,984 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:02,984 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,987 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 18:40:02,988 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 18:40:02,990 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 18:40:03,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:03,013 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 18:40:03,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,015 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 18:40:03,016 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 18:40:03,017 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 18:40:03,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:03,072 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:40:03,073 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:40:03,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,075 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 18:40:03,076 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 18:40:03,077 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:03,094 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 18:40:03,094 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 18:40:03,094 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:03,094 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, x3) = 1*x2 - 1*x3 Supporting invariants [1*x2 - 1*n >= 0, 15*x3 - 2 >= 0] [2025-04-26 18:40:03,100 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 18:40:03,106 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:40:03,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:03,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:03,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:03,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:03,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:03,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:03,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:03,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:03,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:03,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:40:03,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:03,272 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 18:40:03,273 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2025-04-26 18:40:03,273 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4467 states and 7718 transitions. cyclomatic complexity: 3358 Second operand has 8 states, 8 states have (on average 1.625) internal successors, (in total 13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,406 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4467 states and 7718 transitions. cyclomatic complexity: 3358. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (in total 13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7077 states and 11908 transitions. Complement of second has 10 states. [2025-04-26 18:40:03,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:40:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (in total 13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2025-04-26 18:40:03,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 18:40:03,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 18:40:03,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 18:40:03,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7077 states and 11908 transitions. [2025-04-26 18:40:03,510 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 1230 [2025-04-26 18:40:03,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7077 states to 6128 states and 10373 transitions. [2025-04-26 18:40:03,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2949 [2025-04-26 18:40:03,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3017 [2025-04-26 18:40:03,575 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6128 states and 10373 transitions. [2025-04-26 18:40:03,575 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:03,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6128 states and 10373 transitions. [2025-04-26 18:40:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6128 states and 10373 transitions. [2025-04-26 18:40:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6128 to 5779. [2025-04-26 18:40:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5779 states, 5779 states have (on average 1.706696660321855) internal successors, (in total 9863), 5778 states have internal predecessors, (9863), 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 18:40:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5779 states to 5779 states and 9863 transitions. [2025-04-26 18:40:03,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5779 states and 9863 transitions. [2025-04-26 18:40:03,684 INFO L438 stractBuchiCegarLoop]: Abstraction has 5779 states and 9863 transitions. [2025-04-26 18:40:03,684 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:03,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5779 states and 9863 transitions. [2025-04-26 18:40:03,707 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 1155 [2025-04-26 18:40:03,707 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:03,707 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:03,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:03,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:03,708 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L18-->L19: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[97] L19-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[98] L20-->L21: Formula: (= v_x1_4 (* v_x1_5 2)) InVars {x1=v_x1_5} OutVars{x1=v_x1_4} AuxVars[] AssignedVars[x1]" "[99] L21-->L22: Formula: (= v_x1_6 (* v_x1_7 2)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L22-->L18: Formula: (= (* v_x1_9 2) v_x1_8) InVars {x1=v_x1_9} OutVars{x1=v_x1_8} AuxVars[] AssignedVars[x1]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:03,708 INFO L754 eck$LassoCheckResult]: Loop: "[102] L29-->L30: Formula: (< v_x2_4 v_n_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[104] L30-->L31: Formula: (= (* v_x2_6 2) v_x2_5) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[105] L31-->L32: Formula: (= v_x2_7 (* v_x2_8 2)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[106] L32-->L33: Formula: (= v_x2_9 (* 2 v_x2_10)) InVars {x2=v_x2_10} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[x2]" "[107] L33-->L29: Formula: (= v_x2_1 (* v_x2_2 2)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:03,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1625453103, now seen corresponding path program 1 times [2025-04-26 18:40:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:03,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67400834] [2025-04-26 18:40:03,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:03,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:03,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:03,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:03,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:03,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:03,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:03,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 126030855, now seen corresponding path program 2 times [2025-04-26 18:40:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:03,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136987794] [2025-04-26 18:40:03,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:03,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:03,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:03,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:03,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:03,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:03,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1160327527, now seen corresponding path program 1 times [2025-04-26 18:40:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:03,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267444468] [2025-04-26 18:40:03,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:03,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:03,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:03,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:03,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:03,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:03,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:03,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:03,845 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:03,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:03,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:03,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:03,845 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:03,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:03,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:03,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:03,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:03,846 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:03,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,924 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:03,925 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,928 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 18:40:03,929 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 18:40:03,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,942 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,942 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:03,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,950 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 18:40:03,951 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 18:40:03,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,964 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,964 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,969 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 18:40:03,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,971 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 18:40:03,972 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 18:40:03,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,984 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,984 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar1=0} Honda state: {thread2Thread1of1ForFork1_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,989 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 18:40:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,991 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 18:40:03,992 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 18:40:03,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:04,017 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 18:40:04,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,019 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 18:40:04,019 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 18:40:04,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:04,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:04,085 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:04,089 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 18:40:04,090 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:04,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:04,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:04,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:04,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:04,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:04,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:04,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:04,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:04,090 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:04,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:04,171 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:04,172 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,174 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 18:40:04,175 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 18:40:04,176 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 18:40:04,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:04,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:04,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:04,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:04,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:04,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:04,191 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:04,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:04,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,198 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 18:40:04,199 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 18:40:04,200 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 18:40:04,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:04,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:04,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:04,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:04,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:04,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:04,219 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:04,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:40:04,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,226 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 18:40:04,228 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 18:40:04,229 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 18:40:04,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:04,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:04,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:04,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:04,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:04,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:04,245 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:04,251 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 18:40:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,255 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 18:40:04,257 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 18:40:04,259 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 18:40:04,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:04,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:04,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:04,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:04,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:04,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:04,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:04,294 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:04,294 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,296 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 18:40:04,298 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 18:40:04,299 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:04,316 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 18:40:04,317 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 18:40:04,317 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:04,317 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = 1*x1 - 1*x2 Supporting invariants [-1*n + 1*x1 >= 0, 15*x2 - 1 >= 0] [2025-04-26 18:40:04,323 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 18:40:04,328 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:40:04,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:04,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:04,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:04,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:04,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:04,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 18:40:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:04,531 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 18:40:04,531 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-04-26 18:40:04,532 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5779 states and 9863 transitions. cyclomatic complexity: 4222 Second operand has 7 states, 7 states have (on average 2.0) 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 18:40:04,660 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5779 states and 9863 transitions. cyclomatic complexity: 4222. Second operand has 7 states, 7 states have (on average 2.0) 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 8577 states and 15448 transitions. Complement of second has 7 states. [2025-04-26 18:40:04,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) 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 18:40:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-26 18:40:04,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 18:40:04,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:04,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 18:40:04,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:04,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 18:40:04,664 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:04,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8577 states and 15448 transitions. [2025-04-26 18:40:04,698 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 340 [2025-04-26 18:40:04,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8577 states to 7227 states and 12683 transitions. [2025-04-26 18:40:04,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2837 [2025-04-26 18:40:04,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3400 [2025-04-26 18:40:04,743 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7227 states and 12683 transitions. [2025-04-26 18:40:04,743 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:04,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7227 states and 12683 transitions. [2025-04-26 18:40:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states and 12683 transitions. [2025-04-26 18:40:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 6554. [2025-04-26 18:40:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6554 states, 6554 states have (on average 1.7647238327738786) internal successors, (in total 11566), 6553 states have internal predecessors, (11566), 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 18:40:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 11566 transitions. [2025-04-26 18:40:04,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6554 states and 11566 transitions. [2025-04-26 18:40:04,852 INFO L438 stractBuchiCegarLoop]: Abstraction has 6554 states and 11566 transitions. [2025-04-26 18:40:04,852 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:04,852 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6554 states and 11566 transitions. [2025-04-26 18:40:04,892 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 340 [2025-04-26 18:40:04,893 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,893 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:04,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:04,894 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[101] L29-->thread2FINAL: Formula: (<= v_n_3 v_x2_3) InVars {x2=v_x2_3, n=v_n_3} OutVars{x2=v_x2_3, n=v_n_3} AuxVars[] AssignedVars[]" "[103] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L64-->L40: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[108] L40-->thread3FINAL: Formula: (<= v_n_6 v_x3_12) InVars {n=v_n_6, x3=v_x3_12} OutVars{n=v_n_6, x3=v_x3_12} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L65-->L51: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 18:40:04,894 INFO L754 eck$LassoCheckResult]: Loop: "[116] L51-->L52: Formula: (< v_x4_8 v_n_8) InVars {x4=v_x4_8, n=v_n_8} OutVars{x4=v_x4_8, n=v_n_8} AuxVars[] AssignedVars[]" "[118] L52-->L53: Formula: (= v_x4_9 (* 2 v_x4_10)) InVars {x4=v_x4_10} OutVars{x4=v_x4_9} AuxVars[] AssignedVars[x4]" "[119] L53-->L54: Formula: (= (* 2 v_x4_12) v_x4_11) InVars {x4=v_x4_12} OutVars{x4=v_x4_11} AuxVars[] AssignedVars[x4]" "[120] L54-->L55: Formula: (= v_x4_3 (* v_x4_4 2)) InVars {x4=v_x4_4} OutVars{x4=v_x4_3} AuxVars[] AssignedVars[x4]" "[121] L55-->L51: Formula: (= (* v_x4_6 2) v_x4_5) InVars {x4=v_x4_6} OutVars{x4=v_x4_5} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:04,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1239212135, now seen corresponding path program 1 times [2025-04-26 18:40:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824211609] [2025-04-26 18:40:04,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:04,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:04,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:04,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:04,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash 139391125, now seen corresponding path program 1 times [2025-04-26 18:40:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976339326] [2025-04-26 18:40:04,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:04,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1717055491, now seen corresponding path program 1 times [2025-04-26 18:40:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950946756] [2025-04-26 18:40:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,970 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 18:40:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:04,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950946756] [2025-04-26 18:40:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950946756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166418200] [2025-04-26 18:40:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:04,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:04,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:04,990 INFO L87 Difference]: Start difference. First operand 6554 states and 11566 transitions. cyclomatic complexity: 5134 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 18:40:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:05,091 INFO L93 Difference]: Finished difference Result 8266 states and 14523 transitions. [2025-04-26 18:40:05,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8266 states and 14523 transitions. [2025-04-26 18:40:05,127 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 340 [2025-04-26 18:40:05,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8266 states to 7675 states and 13556 transitions. [2025-04-26 18:40:05,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3235 [2025-04-26 18:40:05,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3235 [2025-04-26 18:40:05,170 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7675 states and 13556 transitions. [2025-04-26 18:40:05,170 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:05,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7675 states and 13556 transitions. [2025-04-26 18:40:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7675 states and 13556 transitions. [2025-04-26 18:40:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7675 to 6761. [2025-04-26 18:40:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6761 states have (on average 1.7645318739831386) internal successors, (in total 11930), 6760 states have internal predecessors, (11930), 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 18:40:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 11930 transitions. [2025-04-26 18:40:05,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6761 states and 11930 transitions. [2025-04-26 18:40:05,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:05,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 6761 states and 11930 transitions. [2025-04-26 18:40:05,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:05,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6761 states and 11930 transitions. [2025-04-26 18:40:05,288 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 340 [2025-04-26 18:40:05,288 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:05,288 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:05,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:05,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:05,290 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[101] L29-->thread2FINAL: Formula: (<= v_n_3 v_x2_3) InVars {x2=v_x2_3, n=v_n_3} OutVars{x2=v_x2_3, n=v_n_3} AuxVars[] AssignedVars[]" "[103] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L64-->L40: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[109] L40-->L41: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L41-->L42: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[112] L42-->L43: Formula: (= (* v_x3_7 2) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[113] L43-->L44: Formula: (= v_x3_8 (* v_x3_9 2)) InVars {x3=v_x3_9} OutVars{x3=v_x3_8} AuxVars[] AssignedVars[x3]" "[133] L65-->L51: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[114] L44-->L40: Formula: (= (* 2 v_x3_11) v_x3_10) InVars {x3=v_x3_11} OutVars{x3=v_x3_10} AuxVars[] AssignedVars[x3]" "[108] L40-->thread3FINAL: Formula: (<= v_n_6 v_x3_12) InVars {n=v_n_6, x3=v_x3_12} OutVars{n=v_n_6, x3=v_x3_12} AuxVars[] AssignedVars[]" [2025-04-26 18:40:05,290 INFO L754 eck$LassoCheckResult]: Loop: "[116] L51-->L52: Formula: (< v_x4_8 v_n_8) InVars {x4=v_x4_8, n=v_n_8} OutVars{x4=v_x4_8, n=v_n_8} AuxVars[] AssignedVars[]" "[118] L52-->L53: Formula: (= v_x4_9 (* 2 v_x4_10)) InVars {x4=v_x4_10} OutVars{x4=v_x4_9} AuxVars[] AssignedVars[x4]" "[119] L53-->L54: Formula: (= (* 2 v_x4_12) v_x4_11) InVars {x4=v_x4_12} OutVars{x4=v_x4_11} AuxVars[] AssignedVars[x4]" "[120] L54-->L55: Formula: (= v_x4_3 (* v_x4_4 2)) InVars {x4=v_x4_4} OutVars{x4=v_x4_3} AuxVars[] AssignedVars[x4]" "[121] L55-->L51: Formula: (= (* v_x4_6 2) v_x4_5) InVars {x4=v_x4_6} OutVars{x4=v_x4_5} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:05,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash -544198446, now seen corresponding path program 1 times [2025-04-26 18:40:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588838357] [2025-04-26 18:40:05,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:40:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:40:05,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:40:05,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:40:05,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 139391125, now seen corresponding path program 2 times [2025-04-26 18:40:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799473628] [2025-04-26 18:40:05,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:05,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1342072220, now seen corresponding path program 1 times [2025-04-26 18:40:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147294899] [2025-04-26 18:40:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:40:05,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:40:05,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:40:05,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:40:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,480 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,480 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:05,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:40:05,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,481 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,609 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:05,609 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:05,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,612 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 18:40:05,614 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 18:40:05,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,630 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,630 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar1=0} Honda state: {thread3Thread1of1ForFork2_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,637 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 18:40:05,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,639 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 18:40:05,641 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 18:40:05,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,652 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,653 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar0=0} Honda state: {thread3Thread1of1ForFork2_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:05,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,661 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 18:40:05,662 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 18:40:05,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,673 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,673 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar2=0} Honda state: {thread3Thread1of1ForFork2_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:40:05,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,682 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 18:40:05,683 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 18:40:05,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,697 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,697 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:40:05,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,704 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 18:40:05,705 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 18:40:05,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,717 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,717 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork3_thidvar0=0} Honda state: {thread4Thread1of1ForFork3_thidvar0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:40:05,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,724 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 18:40:05,725 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 18:40:05,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,736 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,736 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar1=0} Honda state: {thread2Thread1of1ForFork1_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,742 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 18:40:05,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,744 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 18:40:05,744 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 18:40:05,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,757 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,757 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,762 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 18:40:05,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,764 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 18:40:05,765 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 18:40:05,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,776 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,776 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork3_thidvar3=0} Honda state: {thread4Thread1of1ForFork3_thidvar3=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,781 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 18:40:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,783 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 18:40:05,784 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 18:40:05,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,796 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,796 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork3_thidvar2=0} Honda state: {thread4Thread1of1ForFork3_thidvar2=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,801 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 18:40:05,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,803 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 18:40:05,804 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 18:40:05,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:40:05,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,831 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 18:40:05,832 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 18:40:05,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:05,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,911 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:05,916 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 18:40:05,916 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,916 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:05,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:40:05,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,916 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,045 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:06,045 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:06,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,050 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 18:40:06,051 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 18:40:06,052 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 18:40:06,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,067 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,075 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 18:40:06,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,080 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 18:40:06,088 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 18:40:06,088 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 18:40:06,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,103 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,112 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 18:40:06,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,117 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 18:40:06,118 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 18:40:06,119 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 18:40:06,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,132 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,137 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 18:40:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,139 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 18:40:06,142 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 18:40:06,142 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 18:40:06,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,155 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,164 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 18:40:06,166 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 18:40:06,167 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 18:40:06,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,180 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,187 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 18:40:06,188 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 18:40:06,189 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 18:40:06,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,201 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,206 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 18:40:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,208 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:06,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:40:06,210 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 18:40:06,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,227 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:06,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,249 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:06,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:40:06,252 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 18:40:06,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,264 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 18:40:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,271 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:06,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:40:06,273 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 18:40:06,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:06,296 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:40:06,296 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,298 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:40:06,300 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:06,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:40:06,316 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:06,316 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:06,316 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x4) = 1*n - 1*x4 Supporting invariants [15*x4 - 1 >= 0] [2025-04-26 18:40:06,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:06,324 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:06,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:40:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:40:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:06,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:06,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:06,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:06,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:06,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:06,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 18:40:06,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:06,512 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 18:40:06,512 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-04-26 18:40:06,512 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6761 states and 11930 transitions. cyclomatic complexity: 5306 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (in total 20), 6 states have internal predecessors, (20), 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 18:40:06,615 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6761 states and 11930 transitions. cyclomatic complexity: 5306. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (in total 20), 6 states have internal predecessors, (20), 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 8929 states and 15580 transitions. Complement of second has 7 states. [2025-04-26 18:40:06,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (in total 20), 6 states have internal predecessors, (20), 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 18:40:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-26 18:40:06,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 18:40:06,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 18:40:06,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 18:40:06,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8929 states and 15580 transitions. [2025-04-26 18:40:06,678 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 265 [2025-04-26 18:40:06,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8929 states to 4214 states and 7553 transitions. [2025-04-26 18:40:06,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1929 [2025-04-26 18:40:06,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1929 [2025-04-26 18:40:06,696 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4214 states and 7553 transitions. [2025-04-26 18:40:06,696 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:06,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4214 states and 7553 transitions. [2025-04-26 18:40:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states and 7553 transitions. [2025-04-26 18:40:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4182. [2025-04-26 18:40:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4182 states have (on average 1.7967479674796747) internal successors, (in total 7514), 4181 states have internal predecessors, (7514), 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 18:40:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 7514 transitions. [2025-04-26 18:40:06,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4182 states and 7514 transitions. [2025-04-26 18:40:06,777 INFO L438 stractBuchiCegarLoop]: Abstraction has 4182 states and 7514 transitions. [2025-04-26 18:40:06,777 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:40:06,777 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4182 states and 7514 transitions. [2025-04-26 18:40:06,800 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 265 [2025-04-26 18:40:06,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:06,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:06,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:06,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:06,801 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L18-->L19: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[97] L19-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[98] L20-->L21: Formula: (= v_x1_4 (* v_x1_5 2)) InVars {x1=v_x1_5} OutVars{x1=v_x1_4} AuxVars[] AssignedVars[x1]" "[99] L21-->L22: Formula: (= v_x1_6 (* v_x1_7 2)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L22-->L18: Formula: (= (* v_x1_9 2) v_x1_8) InVars {x1=v_x1_9} OutVars{x1=v_x1_8} AuxVars[] AssignedVars[x1]" "[95] L18-->L19: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[97] L19-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[98] L20-->L21: Formula: (= v_x1_4 (* v_x1_5 2)) InVars {x1=v_x1_5} OutVars{x1=v_x1_4} AuxVars[] AssignedVars[x1]" "[130] L64-->L40: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[99] L21-->L22: Formula: (= v_x1_6 (* v_x1_7 2)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[100] L22-->L18: Formula: (= (* v_x1_9 2) v_x1_8) InVars {x1=v_x1_9} OutVars{x1=v_x1_8} AuxVars[] AssignedVars[x1]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[101] L29-->thread2FINAL: Formula: (<= v_n_3 v_x2_3) InVars {x2=v_x2_3, n=v_n_3} OutVars{x2=v_x2_3, n=v_n_3} AuxVars[] AssignedVars[]" [2025-04-26 18:40:06,801 INFO L754 eck$LassoCheckResult]: Loop: "[109] L40-->L41: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L41-->L42: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[112] L42-->L43: Formula: (= (* v_x3_7 2) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[113] L43-->L44: Formula: (= v_x3_8 (* v_x3_9 2)) InVars {x3=v_x3_9} OutVars{x3=v_x3_8} AuxVars[] AssignedVars[x3]" "[114] L44-->L40: Formula: (= (* 2 v_x3_11) v_x3_10) InVars {x3=v_x3_11} OutVars{x3=v_x3_10} AuxVars[] AssignedVars[x3]" [2025-04-26 18:40:06,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1226863687, now seen corresponding path program 1 times [2025-04-26 18:40:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342532714] [2025-04-26 18:40:06,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:06,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:06,850 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 18:40:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:06,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342532714] [2025-04-26 18:40:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342532714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719656452] [2025-04-26 18:40:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:06,851 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:06,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 132710990, now seen corresponding path program 2 times [2025-04-26 18:40:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432194275] [2025-04-26 18:40:06,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:06,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:06,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:06,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:06,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:06,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:06,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:06,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:06,870 INFO L87 Difference]: Start difference. First operand 4182 states and 7514 transitions. cyclomatic complexity: 3395 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:06,926 INFO L93 Difference]: Finished difference Result 4651 states and 8318 transitions. [2025-04-26 18:40:06,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4651 states and 8318 transitions. [2025-04-26 18:40:06,941 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 265 [2025-04-26 18:40:06,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4651 states to 4620 states and 8271 transitions. [2025-04-26 18:40:06,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2078 [2025-04-26 18:40:06,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2078 [2025-04-26 18:40:06,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4620 states and 8271 transitions. [2025-04-26 18:40:06,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:06,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4620 states and 8271 transitions. [2025-04-26 18:40:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states and 8271 transitions. [2025-04-26 18:40:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4584. [2025-04-26 18:40:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4584 states have (on average 1.7914485165794067) internal successors, (in total 8212), 4583 states have internal predecessors, (8212), 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 18:40:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 8212 transitions. [2025-04-26 18:40:07,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4584 states and 8212 transitions. [2025-04-26 18:40:07,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:07,007 INFO L438 stractBuchiCegarLoop]: Abstraction has 4584 states and 8212 transitions. [2025-04-26 18:40:07,007 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:40:07,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4584 states and 8212 transitions. [2025-04-26 18:40:07,017 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 265 [2025-04-26 18:40:07,017 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:07,017 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:07,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:07,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:07,018 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L63: Formula: (and (< 0 v_x3_1) (< 0 v_x1_11) (= v_x1_11 v_x2_11) (= v_x4_1 v_x3_1)) InVars {x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} OutVars{x1=v_x1_11, x4=v_x4_1, x2=v_x2_11, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L63-->L18: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L18-->L19: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[97] L19-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[98] L20-->L21: Formula: (= v_x1_4 (* v_x1_5 2)) InVars {x1=v_x1_5} OutVars{x1=v_x1_4} AuxVars[] AssignedVars[x1]" "[99] L21-->L22: Formula: (= v_x1_6 (* v_x1_7 2)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[127] L63-1-->L29: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[100] L22-->L18: Formula: (= (* v_x1_9 2) v_x1_8) InVars {x1=v_x1_9} OutVars{x1=v_x1_8} AuxVars[] AssignedVars[x1]" "[94] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_10) InVars {x1=v_x1_10, n=v_n_2} OutVars{x1=v_x1_10, n=v_n_2} AuxVars[] AssignedVars[]" "[102] L29-->L30: Formula: (< v_x2_4 v_n_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[104] L30-->L31: Formula: (= (* v_x2_6 2) v_x2_5) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[105] L31-->L32: Formula: (= v_x2_7 (* v_x2_8 2)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[106] L32-->L33: Formula: (= v_x2_9 (* 2 v_x2_10)) InVars {x2=v_x2_10} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[x2]" "[130] L64-->L40: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L33-->L29: Formula: (= v_x2_1 (* v_x2_2 2)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[101] L29-->thread2FINAL: Formula: (<= v_n_3 v_x2_3) InVars {x2=v_x2_3, n=v_n_3} OutVars{x2=v_x2_3, n=v_n_3} AuxVars[] AssignedVars[]" [2025-04-26 18:40:07,018 INFO L754 eck$LassoCheckResult]: Loop: "[109] L40-->L41: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L41-->L42: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[112] L42-->L43: Formula: (= (* v_x3_7 2) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[113] L43-->L44: Formula: (= v_x3_8 (* v_x3_9 2)) InVars {x3=v_x3_9} OutVars{x3=v_x3_8} AuxVars[] AssignedVars[x3]" "[114] L44-->L40: Formula: (= (* 2 v_x3_11) v_x3_10) InVars {x3=v_x3_11} OutVars{x3=v_x3_10} AuxVars[] AssignedVars[x3]" [2025-04-26 18:40:07,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1616769034, now seen corresponding path program 1 times [2025-04-26 18:40:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:07,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228420907] [2025-04-26 18:40:07,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:07,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:07,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:07,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash 132710990, now seen corresponding path program 3 times [2025-04-26 18:40:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:07,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874031466] [2025-04-26 18:40:07,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:07,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:07,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:07,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:07,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:07,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:07,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:07,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -199446555, now seen corresponding path program 1 times [2025-04-26 18:40:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:07,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578390412] [2025-04-26 18:40:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:07,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:40:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:40:07,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:07,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:40:07,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:40:07,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:07,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:07,182 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:07,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:07,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:07,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:07,182 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:07,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:07,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:07,183 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:40:07,183 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:07,183 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:07,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,281 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:07,281 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:07,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,283 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:40:07,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,295 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:07,295 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:07,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 18:40:07,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,304 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:40:07,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:40:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,342 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:40:07,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:07,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,473 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:07,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:40:07,480 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:07,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:07,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:07,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:07,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:07,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:07,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:07,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x6.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:40:07,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:07,481 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:07,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,564 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:07,564 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:07,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,566 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:40:07,568 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 18:40:07,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,581 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:40:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,589 INFO L229 MonitoredProcess]: Starting monitored process 50 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 18:40:07,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:40:07,591 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 18:40:07,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:07,629 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:40:07,629 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:40:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,631 INFO L229 MonitoredProcess]: Starting monitored process 51 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 18:40:07,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:40:07,634 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:07,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,651 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:07,651 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:07,651 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 1*n - 1*x3 Supporting invariants [15*x3 - 2 >= 0] [2025-04-26 18:40:07,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,659 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:07,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:07,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:07,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:07,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:07,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,841 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 18:40:07,842 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-04-26 18:40:07,842 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4584 states and 8212 transitions. cyclomatic complexity: 3698 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (in total 21), 6 states have internal predecessors, (21), 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 18:40:07,923 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4584 states and 8212 transitions. cyclomatic complexity: 3698. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (in total 21), 6 states have internal predecessors, (21), 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 6357 states and 11199 transitions. Complement of second has 7 states. [2025-04-26 18:40:07,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (in total 21), 6 states have internal predecessors, (21), 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 18:40:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-26 18:40:07,924 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 16 letters. Loop has 5 letters. [2025-04-26 18:40:07,925 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,925 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 21 letters. Loop has 5 letters. [2025-04-26 18:40:07,925 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,925 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 16 letters. Loop has 10 letters. [2025-04-26 18:40:07,925 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6357 states and 11199 transitions. [2025-04-26 18:40:07,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:07,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6357 states to 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:07,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:07,948 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:07,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:40:07,948 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:07,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:07,948 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:07,962 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 18:40:07,963 INFO L201 PluginConnector]: Adding new model exp2x6.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:07 BoogieIcfgContainer [2025-04-26 18:40:07,963 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:07,964 INFO L158 Benchmark]: Toolchain (without parser) took 8652.70ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 86.4MB in the beginning and 65.2MB in the end (delta: 21.2MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,964 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.40ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,964 INFO L158 Benchmark]: Boogie Preprocessor took 27.94ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,965 INFO L158 Benchmark]: RCFGBuilder took 205.97ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 73.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,965 INFO L158 Benchmark]: BuchiAutomizer took 8378.70ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 73.5MB in the beginning and 65.2MB in the end (delta: 8.3MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.40ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.94ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 205.97ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 73.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8378.70ms. Allocated memory was 155.2MB in the beginning and 264.2MB in the end (delta: 109.1MB). Free memory was 73.5MB in the beginning and 65.2MB in the end (delta: 8.3MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 2311 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 540 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 297 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN1 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 771, Number of transitions in reduction automaton: 5594, Number of states in reduction automaton: 3206, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + n and consists of 6 locations. One deterministic module has affine ranking function -1 * x3 + x2 and consists of 7 locations. One deterministic module has affine ranking function x1 + -1 * x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + n and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + n and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:07,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...