/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/exp2x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:58,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:58,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:58,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:58,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:58,502 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:58,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:58,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:58,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:58,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:58,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:58,522 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:58,522 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:58,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:58,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:58,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:58,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:58,525 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:58,526 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:58,526 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:58,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:58,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:58,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:58,758 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:58,758 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:58,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x3.wvr.bpl [2025-04-26 18:39:58,761 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x3.wvr.bpl' [2025-04-26 18:39:58,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:58,778 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:58,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:58,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:58,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:58,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,808 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:58,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:58,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:58,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:58,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:58,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:58,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:58,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:58,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:58,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/1) ... [2025-04-26 18:39:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,863 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:58,866 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:58,886 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:58,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:58,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:58,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:58,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:39:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:39:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:39:58,888 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:58,921 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:58,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:59,004 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:59,004 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:59,015 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:59,015 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:59,015 INFO L201 PluginConnector]: Adding new model exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:59 BoogieIcfgContainer [2025-04-26 18:39:59,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:59,016 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:59,016 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:59,020 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:59,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:59,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:58" (1/2) ... [2025-04-26 18:39:59,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31c386b3 and model type exp2x3.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,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:59,022 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:59" (2/2) ... [2025-04-26 18:39:59,023 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp2x3.wvr.bpl [2025-04-26 18:39:59,067 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:39:59,098 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,100 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,103 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,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 18:39:59,173 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 18:39:59,175 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:39:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 4/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 18:39:59,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 18:39:59,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-04-26 18:39:59,183 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 38 places, 29 transitions, 82 flow [2025-04-26 18:39:59,185 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 82 flow [2025-04-26 18:39:59,259 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 431 states, 429 states have (on average 3.8578088578088576) internal successors, (in total 1655), 430 states have internal predecessors, (1655), 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,263 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 431 states, 429 states have (on average 3.8578088578088576) internal successors, (in total 1655), 430 states have internal predecessors, (1655), 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,265 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:59,431 WARN L140 AmpleReduction]: Number of pruned transitions: 543 [2025-04-26 18:39:59,431 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:59,431 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 18:39:59,431 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 18:39:59,431 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:219 [2025-04-26 18:39:59,431 WARN L145 AmpleReduction]: Times succ was already a loop node:370 [2025-04-26 18:39:59,432 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:49 [2025-04-26 18:39:59,432 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:59,434 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 431 states, 429 states have (on average 2.5920745920745922) internal successors, (in total 1112), 430 states have internal predecessors, (1112), 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,440 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:59,441 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:59,441 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:59,441 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:59,441 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:59,441 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:59,441 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:59,441 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:59,443 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 431 states, 429 states have (on average 2.5920745920745922) internal successors, (in total 1112), 430 states have internal predecessors, (1112), 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,471 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:39:59,472 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:59,472 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:59,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:59,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:59,475 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:59,477 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 431 states, 429 states have (on average 2.5920745920745922) internal successors, (in total 1112), 430 states have internal predecessors, (1112), 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,486 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:39:59,486 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:59,486 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:59,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:59,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:59,490 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" [2025-04-26 18:39:59,490 INFO L754 eck$LassoCheckResult]: Loop: "[71] 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[]" "[73] L19-->L18: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:39:59,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2980, now seen corresponding path program 1 times [2025-04-26 18:39:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183192210] [2025-04-26 18:39:59,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 3235, now seen corresponding path program 1 times [2025-04-26 18:39:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372720759] [2025-04-26 18:39:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2866054, now seen corresponding path program 1 times [2025-04-26 18:39:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271643657] [2025-04-26 18:39:59,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:59,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,662 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:59,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:59,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:59,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:59,663 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:59,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:59,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:59,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:59,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:59,663 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:59,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,774 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:59,775 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:59,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,778 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:39:59,780 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:39:59,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:59,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,811 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:39:59,813 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:39:59,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:59,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,883 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:59,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,888 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:59,888 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:59,888 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:59,888 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:59,888 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:59,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:59,889 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:59,889 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:59,889 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:59,889 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:59,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,959 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:59,972 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,978 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:39:59,982 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:39:59,983 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:00,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:00,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:00,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:00,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:00,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:00,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:00,050 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:00,062 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:00,062 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,066 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:00,067 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:00,070 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:00,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:00,087 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:00,087 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:00,087 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -1*x1 + 1*n Supporting invariants [1*x1 - 1 >= 0] [2025-04-26 18:40:00,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:00,098 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:00,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,140 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,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:00,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:00,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,160 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,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:00,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:00,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:00,178 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:00,195 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:00,196 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 431 states, 429 states have (on average 2.5920745920745922) internal successors, (in total 1112), 430 states have internal predecessors, (1112), 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 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:00,326 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 431 states, 429 states have (on average 2.5920745920745922) internal successors, (in total 1112), 430 states have internal predecessors, (1112), 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 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1024 states and 2643 transitions. Complement of second has 8 states. [2025-04-26 18:40:00,327 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:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-26 18:40:00,334 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:00,334 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:00,334 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:00,335 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:00,335 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:40:00,335 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:00,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1024 states and 2643 transitions. [2025-04-26 18:40:00,349 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:40:00,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1024 states to 532 states and 1372 transitions. [2025-04-26 18:40:00,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-04-26 18:40:00,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2025-04-26 18:40:00,362 INFO L74 IsDeterministic]: Start isDeterministic. Operand 532 states and 1372 transitions. [2025-04-26 18:40:00,363 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:00,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 532 states and 1372 transitions. [2025-04-26 18:40:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 1372 transitions. [2025-04-26 18:40:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 457. [2025-04-26 18:40:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 457 states have (on average 2.5798687089715537) internal successors, (in total 1179), 456 states have internal predecessors, (1179), 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,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1179 transitions. [2025-04-26 18:40:00,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 457 states and 1179 transitions. [2025-04-26 18:40:00,411 INFO L438 stractBuchiCegarLoop]: Abstraction has 457 states and 1179 transitions. [2025-04-26 18:40:00,411 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:00,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 457 states and 1179 transitions. [2025-04-26 18:40:00,413 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:40:00,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:00,413 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:00,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:00,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:00,414 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[72] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:00,414 INFO L754 eck$LassoCheckResult]: Loop: "[75] L26-->L27: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[77] L27-->L26: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:00,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 88846770, now seen corresponding path program 1 times [2025-04-26 18:40:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526941322] [2025-04-26 18:40:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:00,418 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,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:00,420 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,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 18:40:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098787321] [2025-04-26 18:40:00,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,427 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,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,430 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,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -517597548, now seen corresponding path program 1 times [2025-04-26 18:40:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808153271] [2025-04-26 18:40:00,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:00,441 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,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:00,484 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:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:00,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808153271] [2025-04-26 18:40:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808153271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37506402] [2025-04-26 18:40:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:00,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:00,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:00,506 INFO L87 Difference]: Start difference. First operand 457 states and 1179 transitions. cyclomatic complexity: 829 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:00,575 INFO L93 Difference]: Finished difference Result 506 states and 1265 transitions. [2025-04-26 18:40:00,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 1265 transitions. [2025-04-26 18:40:00,578 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 250 [2025-04-26 18:40:00,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 1265 transitions. [2025-04-26 18:40:00,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2025-04-26 18:40:00,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2025-04-26 18:40:00,584 INFO L74 IsDeterministic]: Start isDeterministic. Operand 506 states and 1265 transitions. [2025-04-26 18:40:00,585 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:00,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 506 states and 1265 transitions. [2025-04-26 18:40:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 1265 transitions. [2025-04-26 18:40:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 460. [2025-04-26 18:40:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 460 states have (on average 2.5695652173913044) internal successors, (in total 1182), 459 states have internal predecessors, (1182), 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,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1182 transitions. [2025-04-26 18:40:00,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 460 states and 1182 transitions. [2025-04-26 18:40:00,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:00,603 INFO L438 stractBuchiCegarLoop]: Abstraction has 460 states and 1182 transitions. [2025-04-26 18:40:00,603 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:00,603 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 460 states and 1182 transitions. [2025-04-26 18:40:00,605 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:40:00,605 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:00,605 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:00,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:00,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:00,606 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[71] 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[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L19-->L18: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:00,606 INFO L754 eck$LassoCheckResult]: Loop: "[75] L26-->L27: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[77] L27-->L26: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:00,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1540672654, now seen corresponding path program 1 times [2025-04-26 18:40:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258275571] [2025-04-26 18:40:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:00,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 18:40:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38166006] [2025-04-26 18:40:00,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:00,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:00,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:00,625 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,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1177299028, now seen corresponding path program 1 times [2025-04-26 18:40:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:00,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952597009] [2025-04-26 18:40:00,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:00,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:00,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:00,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:00,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 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 8 of 8 statements. [2025-04-26 18:40:00,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:00,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:00,719 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:00,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:00,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:00,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:00,719 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:00,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:00,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:00,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:00,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:00,719 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:00,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:00,797 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:00,797 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,799 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:00,800 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:00,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,813 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:00,813 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork3_thidvar0=0} Honda state: {thread1Thread1of1ForFork3_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:00,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,820 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:00,822 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:00,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,834 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:00,834 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:00,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:40:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,842 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:00,843 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:00,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,855 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:00,855 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:00,861 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:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,863 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:00,864 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:00,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,882 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:00,882 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x4=4, x3=4} Honda state: {x4=4, x3=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:00,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,894 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:00,896 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:00,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:00,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:00,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:00,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:00,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,923 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:00,929 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:00,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:00,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,012 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:01,016 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:01,017 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:01,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:01,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:01,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:01,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:01,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:01,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:01,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:01,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:01,017 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:01,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,095 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:01,095 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:01,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,099 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:01,099 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:01,101 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,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,116 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:01,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,124 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:01,124 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:01,125 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,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:40:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,146 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:01,147 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:01,148 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,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,161 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:01,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,168 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:01,169 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:01,170 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,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:40:01,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,193 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:01,194 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:01,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:01,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,206 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,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:01,221 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:01,221 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [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,223 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:01,225 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:01,226 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:01,243 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:01,243 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:01,243 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:01,243 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, n) = -1*x2 + 1*n Supporting invariants [1*x2 - 1 >= 0] [2025-04-26 18:40:01,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:01,254 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:01,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:01,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:01,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:01,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:01,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:01,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:01,322 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,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:01,322 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:01,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:01,336 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,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:01,337 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 460 states and 1182 transitions. cyclomatic complexity: 829 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,413 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 460 states and 1182 transitions. cyclomatic complexity: 829. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1070 states and 2904 transitions. Complement of second has 7 states. [2025-04-26 18:40:01,413 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:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-26 18:40:01,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:01,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:40:01,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,414 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:40:01,414 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:01,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1070 states and 2904 transitions. [2025-04-26 18:40:01,422 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:40:01,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1070 states to 742 states and 1906 transitions. [2025-04-26 18:40:01,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 271 [2025-04-26 18:40:01,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 400 [2025-04-26 18:40:01,428 INFO L74 IsDeterministic]: Start isDeterministic. Operand 742 states and 1906 transitions. [2025-04-26 18:40:01,428 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:01,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1906 transitions. [2025-04-26 18:40:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1906 transitions. [2025-04-26 18:40:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 599. [2025-04-26 18:40:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 599 states have (on average 2.671118530884808) internal successors, (in total 1600), 598 states have internal predecessors, (1600), 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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1600 transitions. [2025-04-26 18:40:01,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 599 states and 1600 transitions. [2025-04-26 18:40:01,441 INFO L438 stractBuchiCegarLoop]: Abstraction has 599 states and 1600 transitions. [2025-04-26 18:40:01,442 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:01,442 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 599 states and 1600 transitions. [2025-04-26 18:40:01,444 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:40:01,444 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:01,444 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:01,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:01,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:01,445 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[72] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[74] L26-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[76] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] L52-->L34: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 18:40:01,445 INFO L754 eck$LassoCheckResult]: Loop: "[79] L34-->L35: Formula: (< v_x3_4 v_n_6) InVars {n=v_n_6, x3=v_x3_4} OutVars{n=v_n_6, x3=v_x3_4} AuxVars[] AssignedVars[]" "[81] L35-->L34: Formula: (= v_x3_5 (* v_x3_6 2)) InVars {x3=v_x3_6} OutVars{x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 18:40:01,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1134344295, now seen corresponding path program 1 times [2025-04-26 18:40:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:01,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711893734] [2025-04-26 18:40:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:01,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:01,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:01,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:01,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:01,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:01,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:01,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2025-04-26 18:40:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:01,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177819248] [2025-04-26 18:40:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:01,462 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,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:01,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:01,463 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,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:01,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -816823159, now seen corresponding path program 1 times [2025-04-26 18:40:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:01,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734100234] [2025-04-26 18:40:01,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:01,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:01,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:01,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:01,570 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:01,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:01,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:01,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:01,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:01,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:01,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:01,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:01,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:01,570 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:01,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,657 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:01,657 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:01,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,660 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:01,661 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:01,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:01,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,673 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:01,673 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:01,678 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:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,680 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:01,681 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:01,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:01,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,693 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:01,693 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:01,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:40:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,701 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:01,701 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:01,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:01,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,713 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:01,713 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:01,719 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:01,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,721 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:01,722 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:01,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:01,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:01,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,750 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:01,751 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:01,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:01,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:01,844 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:01,849 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:01,849 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:01,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:01,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:01,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:01,850 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:01,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:01,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:01,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:01,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:01,850 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:01,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:01,959 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:01,959 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:01,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,961 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:01,962 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:01,963 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,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:01,979 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:01,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:40:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:01,986 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:01,987 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:01,988 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,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:01,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:01,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:01,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:01,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:01,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:02,002 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:02,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,010 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:02,010 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:02,011 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:02,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:02,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:02,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:02,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:02,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:02,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:02,025 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:02,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:40:02,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,033 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:02,034 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:02,035 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:02,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:02,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:02,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:02,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:02,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:02,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:02,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:02,063 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:02,064 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,066 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:02,071 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:02,071 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:02,087 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:02,088 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:02,088 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:02,088 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 1*n - 1*x3 Supporting invariants [1*x3 - 1 >= 0] [2025-04-26 18:40:02,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,096 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:02,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:02,122 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,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:02,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:02,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:02,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:02,196 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,197 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:02,197 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 599 states and 1600 transitions. cyclomatic complexity: 1092 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,279 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 599 states and 1600 transitions. cyclomatic complexity: 1092. 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) Result 1602 states and 4354 transitions. Complement of second has 7 states. [2025-04-26 18:40:02,280 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:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. 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,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-26 18:40:02,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:40:02,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:02,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:40:02,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:02,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:40:02,281 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:02,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1602 states and 4354 transitions. [2025-04-26 18:40:02,294 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:40:02,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1602 states to 751 states and 1995 transitions. [2025-04-26 18:40:02,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2025-04-26 18:40:02,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2025-04-26 18:40:02,301 INFO L74 IsDeterministic]: Start isDeterministic. Operand 751 states and 1995 transitions. [2025-04-26 18:40:02,301 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:02,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 751 states and 1995 transitions. [2025-04-26 18:40:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 1995 transitions. [2025-04-26 18:40:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2025-04-26 18:40:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 697 states have (on average 2.6025824964131994) internal successors, (in total 1814), 696 states have internal predecessors, (1814), 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,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1814 transitions. [2025-04-26 18:40:02,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 697 states and 1814 transitions. [2025-04-26 18:40:02,316 INFO L438 stractBuchiCegarLoop]: Abstraction has 697 states and 1814 transitions. [2025-04-26 18:40:02,316 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:02,316 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 697 states and 1814 transitions. [2025-04-26 18:40:02,319 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:40:02,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,319 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:02,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:02,320 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[71] 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[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[73] L19-->L18: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[91] L52-->L34: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[94] L53-->L42: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[74] L26-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[78] L34-->thread3FINAL: Formula: (<= v_n_5 v_x3_3) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" [2025-04-26 18:40:02,320 INFO L754 eck$LassoCheckResult]: Loop: "[83] L42-->L43: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[85] L43-->L42: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:02,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1827230755, now seen corresponding path program 1 times [2025-04-26 18:40:02,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55687237] [2025-04-26 18:40:02,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:02,327 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,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,374 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,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:02,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55687237] [2025-04-26 18:40:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55687237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:02,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:02,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:40:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385981237] [2025-04-26 18:40:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:02,375 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:02,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 18:40:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611956189] [2025-04-26 18:40:02,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:02,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:02,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:02,397 INFO L87 Difference]: Start difference. First operand 697 states and 1814 transitions. cyclomatic complexity: 1198 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 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,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:02,448 INFO L93 Difference]: Finished difference Result 870 states and 2191 transitions. [2025-04-26 18:40:02,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 870 states and 2191 transitions. [2025-04-26 18:40:02,453 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 44 [2025-04-26 18:40:02,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 870 states to 839 states and 2133 transitions. [2025-04-26 18:40:02,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-04-26 18:40:02,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-04-26 18:40:02,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 839 states and 2133 transitions. [2025-04-26 18:40:02,459 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:02,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 839 states and 2133 transitions. [2025-04-26 18:40:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 2133 transitions. [2025-04-26 18:40:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 762. [2025-04-26 18:40:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 762 states have (on average 2.6076115485564304) internal successors, (in total 1987), 761 states have internal predecessors, (1987), 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,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1987 transitions. [2025-04-26 18:40:02,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 762 states and 1987 transitions. [2025-04-26 18:40:02,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:02,474 INFO L438 stractBuchiCegarLoop]: Abstraction has 762 states and 1987 transitions. [2025-04-26 18:40:02,474 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:02,474 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 1987 transitions. [2025-04-26 18:40:02,478 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:40:02,478 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,478 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:02,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:02,480 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[72] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[74] L26-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[76] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] L52-->L34: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[78] L34-->thread3FINAL: Formula: (<= v_n_5 v_x3_3) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[80] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[94] L53-->L42: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 18:40:02,480 INFO L754 eck$LassoCheckResult]: Loop: "[83] L42-->L43: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[85] L43-->L42: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:02,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 448284949, now seen corresponding path program 1 times [2025-04-26 18:40:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760540535] [2025-04-26 18:40:02,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 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 11 of 11 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,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:02,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:02,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 2 times [2025-04-26 18:40:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967024211] [2025-04-26 18:40:02,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1305109047, now seen corresponding path program 1 times [2025-04-26 18:40:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821883844] [2025-04-26 18:40:02,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:02,517 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,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,543 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,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:02,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821883844] [2025-04-26 18:40:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821883844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:02,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096641247] [2025-04-26 18:40:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:02,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:02,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:02,558 INFO L87 Difference]: Start difference. First operand 762 states and 1987 transitions. cyclomatic complexity: 1315 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:02,601 INFO L93 Difference]: Finished difference Result 1415 states and 3667 transitions. [2025-04-26 18:40:02,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 3667 transitions. [2025-04-26 18:40:02,609 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:40:02,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1259 states and 3298 transitions. [2025-04-26 18:40:02,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 381 [2025-04-26 18:40:02,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 381 [2025-04-26 18:40:02,616 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1259 states and 3298 transitions. [2025-04-26 18:40:02,617 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:02,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1259 states and 3298 transitions. [2025-04-26 18:40:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states and 3298 transitions. [2025-04-26 18:40:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 830. [2025-04-26 18:40:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 830 states have (on average 2.5746987951807228) internal successors, (in total 2137), 829 states have internal predecessors, (2137), 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,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2137 transitions. [2025-04-26 18:40:02,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 830 states and 2137 transitions. [2025-04-26 18:40:02,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:02,633 INFO L438 stractBuchiCegarLoop]: Abstraction has 830 states and 2137 transitions. [2025-04-26 18:40:02,633 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:40:02,633 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 830 states and 2137 transitions. [2025-04-26 18:40:02,636 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:40:02,636 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,636 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:02,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:02,636 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L51: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (= v_x4_1 v_x3_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x4=v_x4_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[97] L51-->L18: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[70] L18-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[72] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[88] L51-1-->L26: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[74] L26-->thread2FINAL: Formula: (<= v_n_4 v_x2_4) InVars {x2=v_x2_4, n=v_n_4} OutVars{x2=v_x2_4, n=v_n_4} AuxVars[] AssignedVars[]" "[76] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] L52-->L34: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[79] L34-->L35: Formula: (< v_x3_4 v_n_6) InVars {n=v_n_6, x3=v_x3_4} OutVars{n=v_n_6, x3=v_x3_4} AuxVars[] AssignedVars[]" "[94] L53-->L42: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[81] L35-->L34: Formula: (= v_x3_5 (* v_x3_6 2)) InVars {x3=v_x3_6} OutVars{x3=v_x3_5} AuxVars[] AssignedVars[x3]" "[78] L34-->thread3FINAL: Formula: (<= v_n_5 v_x3_3) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" [2025-04-26 18:40:02,636 INFO L754 eck$LassoCheckResult]: Loop: "[83] L42-->L43: Formula: (< v_x4_3 v_n_7) InVars {x4=v_x4_3, n=v_n_7} OutVars{x4=v_x4_3, n=v_n_7} AuxVars[] AssignedVars[]" "[85] L43-->L42: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:02,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1011974451, now seen corresponding path program 1 times [2025-04-26 18:40:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751234924] [2025-04-26 18:40:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 3 times [2025-04-26 18:40:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541318232] [2025-04-26 18:40:02,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:02,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:02,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1844841173, now seen corresponding path program 1 times [2025-04-26 18:40:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438965521] [2025-04-26 18:40:02,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:02,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:02,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,804 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:02,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:02,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:02,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:02,804 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:02,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:02,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:02,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:40:02,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:02,804 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:02,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,928 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:02,929 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,933 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:02,935 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:02,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,947 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:02,947 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:02,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,954 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:02,955 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:02,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,966 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:02,966 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:02,972 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:02,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,973 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:02,974 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:02,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,986 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:02,986 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar0=0} Honda state: {thread3Thread1of1ForFork1_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:02,992 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:02,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,994 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:02,994 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:02,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,006 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,006 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_thidvar1=0} Honda state: {thread4Thread1of1ForFork2_thidvar1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,012 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:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,014 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:03,014 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:03,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,026 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,026 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_thidvar0=0} Honda state: {thread4Thread1of1ForFork2_thidvar0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,033 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:03,034 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:03,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,046 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:03,046 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork3_thidvar0=0} Honda state: {thread1Thread1of1ForFork3_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:03,053 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:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,055 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:03,056 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:03,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:03,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,084 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:03,086 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:03,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:03,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:03,189 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:03,193 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:03,194 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:03,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:03,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:03,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:03,194 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:03,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:03,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:03,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:40:03,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:03,194 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:03,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:03,314 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:03,315 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:03,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,316 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:03,317 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:03,318 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,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:03,336 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:03,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,338 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:03,339 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:03,340 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,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:03,358 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:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,359 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:03,360 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:03,361 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,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:03,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:40:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,386 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:03,387 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:03,388 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,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:03,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:03,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:03,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:03,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:03,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:03,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:03,423 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 18:40:03,423 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:40:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:03,425 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:03,426 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:03,427 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:03,443 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:03,443 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:03,444 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:03,444 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x4) = 1*n - 1*x4 Supporting invariants [1*x4 - 1 >= 0] [2025-04-26 18:40:03,449 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:03,451 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:03,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:03,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:03,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:03,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:03,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:03,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:03,551 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:03,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:03,566 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,566 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:03,566 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 830 states and 2137 transitions. cyclomatic complexity: 1410 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,631 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 830 states and 2137 transitions. cyclomatic complexity: 1410. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1489 states and 3735 transitions. Complement of second has 7 states. [2025-04-26 18:40:03,631 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:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-04-26 18:40:03,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:03,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:40:03,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:40:03,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1489 states and 3735 transitions. [2025-04-26 18:40:03,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:03,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1489 states to 0 states and 0 transitions. [2025-04-26 18:40:03,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:03,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:03,640 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:03,640 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:03,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:03,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:03,641 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:03,641 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:40:03,641 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:03,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:03,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:03,652 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:03,653 INFO L201 PluginConnector]: Adding new model exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:03 BoogieIcfgContainer [2025-04-26 18:40:03,653 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:03,654 INFO L158 Benchmark]: Toolchain (without parser) took 4875.99ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.3MB in the beginning and 69.7MB in the end (delta: 13.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:03,654 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.73ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:03,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.32ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:03,654 INFO L158 Benchmark]: Boogie Preprocessor took 25.99ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:03,654 INFO L158 Benchmark]: RCFGBuilder took 179.06ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:03,655 INFO L158 Benchmark]: BuchiAutomizer took 4636.95ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:03,655 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.73ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.32ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.99ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 179.06ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 4636.95ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.0MB in the beginning and 69.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 824 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 125 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN1 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 114ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 338, Number of transitions in reduction automaton: 1112, Number of states in reduction automaton: 431, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 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 n + -1 * x2 and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + n and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + 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:03,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...