/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 16:54:28,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:28,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:28,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:28,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:28,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:28,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:28,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:28,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:28,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:28,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:28,878 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:28,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:28,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:28,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:28,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:28,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:28,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:28,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:28,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:28,881 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:28,881 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:28,881 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:29,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:29,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:29,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:29,093 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:29,093 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:29,095 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 16:54:29,096 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 16:54:29,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:29,115 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:29,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:29,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:29,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:29,126 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,142 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,147 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:29,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:29,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:29,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:29,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:29,153 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,154 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,155 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,155 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,158 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,158 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,162 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,162 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,162 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 04:54:29" (1/1) ... [2025-04-26 16:54:29,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:29,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:29,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:29,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:29,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:29" (1/1) ... [2025-04-26 16:54:29,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:29,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:29,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:29,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:29,217 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:29,217 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:29,217 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:29,217 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:54:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:54:29,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:54:29,218 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:29,255 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:29,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:29,341 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:29,341 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:29,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:29,350 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:29,351 INFO L201 PluginConnector]: Adding new model exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:29 BoogieIcfgContainer [2025-04-26 16:54:29,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:29,352 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:29,352 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:29,357 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:29,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:29,358 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:29" (1/2) ... [2025-04-26 16:54:29,359 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@646e15b2 and model type exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:29, skipping insertion in model container [2025-04-26 16:54:29,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:29,359 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 04:54:29" (2/2) ... [2025-04-26 16:54:29,360 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp2x3.wvr.bpl [2025-04-26 16:54:29,418 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:54:29,460 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:29,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:29,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:29,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 16:54:29,530 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 16:54:29,534 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:54:29,539 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 16:54:29,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 16:54:29,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-04-26 16:54:29,542 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 38 places, 29 transitions, 82 flow [2025-04-26 16:54:29,549 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:29,738 WARN L140 AmpleReduction]: Number of pruned transitions: 543 [2025-04-26 16:54:29,739 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:29,739 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 16:54:29,739 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 16:54:29,739 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:219 [2025-04-26 16:54:29,739 WARN L145 AmpleReduction]: Times succ was already a loop node:370 [2025-04-26 16:54:29,739 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:49 [2025-04-26 16:54:29,739 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:29,742 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 16:54:29,748 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:29,748 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:29,748 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:29,748 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:29,748 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:29,749 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:29,749 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:29,749 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:29,753 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 16:54:29,786 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 16:54:29,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:29,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:29,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:29,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:29,792 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:29,794 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 16:54:29,805 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 16:54:29,809 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:29,809 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:29,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:29,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:29,815 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 16:54:29,816 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 16:54:29,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2980, now seen corresponding path program 1 times [2025-04-26 16:54:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:29,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915502907] [2025-04-26 16:54:29,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:29,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:29,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:29,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:29,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:29,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:29,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 3235, now seen corresponding path program 1 times [2025-04-26 16:54:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:29,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569905475] [2025-04-26 16:54:29,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:29,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:29,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:29,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:29,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:29,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:29,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2866054, now seen corresponding path program 1 times [2025-04-26 16:54:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:29,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789340880] [2025-04-26 16:54:29,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:29,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:29,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:29,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:29,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:29,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:29,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:29,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:30,026 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:30,027 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:30,027 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:30,027 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:30,027 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:30,027 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,027 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:30,027 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:30,027 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:30,027 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:30,027 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:30,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,156 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:30,157 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:30,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:30,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:30,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:30,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:30,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:30,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:30,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:30,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:30,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:30,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:30,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:30,271 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:30,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:30,275 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:30,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:30,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:30,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:30,275 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:30,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:30,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:30,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:30,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:30,276 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:30,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:30,400 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:30,405 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:30,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:30,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:30,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:30,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:30,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:30,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:30,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:30,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:30,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:30,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:30,459 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:30,460 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:30,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:30,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:30,487 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:30,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:54:30,505 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:30,506 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:30,506 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 16:54:30,512 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 16:54:30,516 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:30,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:30,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:30,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:30,629 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 16:54:30,631 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 16:54:30,781 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 16:54:30,782 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 16:54:30,786 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 16:54:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-26 16:54:30,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:30,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:30,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:30,796 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:30,796 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:54:30,797 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:30,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1024 states and 2643 transitions. [2025-04-26 16:54:30,809 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 16:54:30,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1024 states to 532 states and 1372 transitions. [2025-04-26 16:54:30,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-04-26 16:54:30,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2025-04-26 16:54:30,819 INFO L74 IsDeterministic]: Start isDeterministic. Operand 532 states and 1372 transitions. [2025-04-26 16:54:30,819 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:30,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 532 states and 1372 transitions. [2025-04-26 16:54:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 1372 transitions. [2025-04-26 16:54:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 457. [2025-04-26 16:54:30,858 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 16:54:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1179 transitions. [2025-04-26 16:54:30,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 457 states and 1179 transitions. [2025-04-26 16:54:30,861 INFO L438 stractBuchiCegarLoop]: Abstraction has 457 states and 1179 transitions. [2025-04-26 16:54:30,861 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:30,861 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 457 states and 1179 transitions. [2025-04-26 16:54:30,863 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 16:54:30,863 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:30,863 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:30,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:30,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:30,864 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 16:54:30,864 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 16:54:30,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 88846770, now seen corresponding path program 1 times [2025-04-26 16:54:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:30,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544136601] [2025-04-26 16:54:30,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:30,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:30,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:30,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:30,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:30,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:30,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:30,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 16:54:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:30,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651748806] [2025-04-26 16:54:30,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:30,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:30,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:30,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:30,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:30,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:30,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:30,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:30,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:30,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash -517597548, now seen corresponding path program 1 times [2025-04-26 16:54:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:30,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335781815] [2025-04-26 16:54:30,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:30,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:30,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:30,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:30,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335781815] [2025-04-26 16:54:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335781815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632964282] [2025-04-26 16:54:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:30,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:30,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:30,959 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 16:54:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:31,026 INFO L93 Difference]: Finished difference Result 506 states and 1265 transitions. [2025-04-26 16:54:31,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 1265 transitions. [2025-04-26 16:54:31,033 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 250 [2025-04-26 16:54:31,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 1265 transitions. [2025-04-26 16:54:31,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2025-04-26 16:54:31,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2025-04-26 16:54:31,037 INFO L74 IsDeterministic]: Start isDeterministic. Operand 506 states and 1265 transitions. [2025-04-26 16:54:31,037 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:31,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 506 states and 1265 transitions. [2025-04-26 16:54:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 1265 transitions. [2025-04-26 16:54:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 460. [2025-04-26 16:54:31,054 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 16:54:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1182 transitions. [2025-04-26 16:54:31,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 460 states and 1182 transitions. [2025-04-26 16:54:31,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:31,057 INFO L438 stractBuchiCegarLoop]: Abstraction has 460 states and 1182 transitions. [2025-04-26 16:54:31,057 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:31,057 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 460 states and 1182 transitions. [2025-04-26 16:54:31,059 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 16:54:31,059 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:31,059 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:31,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:31,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:31,060 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 16:54:31,060 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 16:54:31,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1540672654, now seen corresponding path program 1 times [2025-04-26 16:54:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762760582] [2025-04-26 16:54:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:31,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:31,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:31,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:31,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:31,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 16:54:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142673620] [2025-04-26 16:54:31,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:31,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:31,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:31,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:31,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:31,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:31,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1177299028, now seen corresponding path program 1 times [2025-04-26 16:54:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983633861] [2025-04-26 16:54:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:31,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:31,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:31,174 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:31,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:31,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:31,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:31,174 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:31,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:31,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:31,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:31,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:31,174 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:31,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,256 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:31,256 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:31,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:31,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:31,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,273 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:31,274 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 16:54:31,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:31,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:31,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,294 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:31,294 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 16:54:31,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:31,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:31,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,315 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:31,315 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 16:54:31,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:31,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:31,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,342 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:31,342 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 16:54:31,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:31,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,355 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:31,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:31,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:31,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:31,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:31,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:31,478 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:31,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:31,483 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:31,483 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:31,483 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:31,483 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:31,483 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:31,483 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,483 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:31,483 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:31,483 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:31,483 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:31,483 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:31,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:31,569 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:31,569 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:31,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,572 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:31,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:31,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:31,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:31,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:31,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:31,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:31,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:31,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:31,598 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 16:54:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,601 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:31,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:31,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:31,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:31,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:31,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:31,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:31,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:31,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:31,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,651 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:31,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:31,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:31,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:31,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:31,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:31,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:31,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:31,670 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:31,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:31,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,679 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:31,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:31,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:31,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:31,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:31,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:31,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:31,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:31,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,707 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:31,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:31,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:31,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:31,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:31,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:31,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:31,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:31,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:31,741 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:31,741 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,743 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:31,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:31,745 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:31,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:54:31,764 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:31,765 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:31,765 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 16:54:31,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:54:31,775 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:31,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:31,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:31,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:31,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:31,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:31,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:31,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:31,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:31,889 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 16:54:31,889 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 16:54:31,996 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 16:54:31,996 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 16:54:31,997 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 16:54:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-26 16:54:31,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:31,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:31,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:54:31,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1070 states and 2904 transitions. [2025-04-26 16:54:32,010 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 16:54:32,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1070 states to 742 states and 1906 transitions. [2025-04-26 16:54:32,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 271 [2025-04-26 16:54:32,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 400 [2025-04-26 16:54:32,020 INFO L74 IsDeterministic]: Start isDeterministic. Operand 742 states and 1906 transitions. [2025-04-26 16:54:32,020 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:32,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 742 states and 1906 transitions. [2025-04-26 16:54:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 1906 transitions. [2025-04-26 16:54:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 599. [2025-04-26 16:54:32,034 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 16:54:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1600 transitions. [2025-04-26 16:54:32,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 599 states and 1600 transitions. [2025-04-26 16:54:32,036 INFO L438 stractBuchiCegarLoop]: Abstraction has 599 states and 1600 transitions. [2025-04-26 16:54:32,036 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:32,036 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 599 states and 1600 transitions. [2025-04-26 16:54:32,039 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 16:54:32,039 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,039 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:32,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:32,039 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 16:54:32,040 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 16:54:32,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1134344295, now seen corresponding path program 1 times [2025-04-26 16:54:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810050183] [2025-04-26 16:54:32,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:32,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2025-04-26 16:54:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126531577] [2025-04-26 16:54:32,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash -816823159, now seen corresponding path program 1 times [2025-04-26 16:54:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323744033] [2025-04-26 16:54:32,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:32,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:32,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:32,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:32,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,151 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:32,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:32,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:32,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:32,151 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:32,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:32,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:32,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:32,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:32,151 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:32,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,236 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:32,237 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:32,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,240 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:32,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:32,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:32,258 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:32,258 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 16:54:32,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,267 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:32,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:32,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:32,281 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:32,281 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 16:54:32,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:32,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,289 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:32,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:32,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:32,301 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:32,301 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 16:54:32,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:54:32,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,309 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:32,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:32,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:32,336 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 16:54:32,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,338 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:32,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:32,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:32,436 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:32,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:54:32,441 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:32,441 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:32,441 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:32,441 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:32,441 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:32,441 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,441 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:32,441 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:32,441 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:32,441 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:32,441 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:32,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,535 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:32,535 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:32,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,537 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:32,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:32,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,554 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:32,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,562 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:32,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:32,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,578 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,584 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 16:54:32,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,586 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:32,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:32,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:54:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,612 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:32,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:32,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:32,640 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:32,641 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:54:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,643 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:54:32,645 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:32,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:54:32,661 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:32,661 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:32,661 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 16:54:32,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:54:32,669 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:32,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:32,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:32,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:54:32,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:32,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:32,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:32,786 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 16:54:32,786 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 16:54:32,865 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 16:54:32,866 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 16:54:32,866 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 16:54:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-26 16:54:32,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:32,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:54:32,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:54:32,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1602 states and 4354 transitions. [2025-04-26 16:54:32,877 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:54:32,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1602 states to 751 states and 1995 transitions. [2025-04-26 16:54:32,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2025-04-26 16:54:32,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2025-04-26 16:54:32,883 INFO L74 IsDeterministic]: Start isDeterministic. Operand 751 states and 1995 transitions. [2025-04-26 16:54:32,883 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:32,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 751 states and 1995 transitions. [2025-04-26 16:54:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 1995 transitions. [2025-04-26 16:54:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2025-04-26 16:54:32,894 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 16:54:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1814 transitions. [2025-04-26 16:54:32,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 697 states and 1814 transitions. [2025-04-26 16:54:32,896 INFO L438 stractBuchiCegarLoop]: Abstraction has 697 states and 1814 transitions. [2025-04-26 16:54:32,896 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:32,896 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 697 states and 1814 transitions. [2025-04-26 16:54:32,898 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:54:32,899 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,899 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:32,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:32,899 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 16:54:32,899 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 16:54:32,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1827230755, now seen corresponding path program 1 times [2025-04-26 16:54:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785230278] [2025-04-26 16:54:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:32,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:32,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:32,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785230278] [2025-04-26 16:54:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785230278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:32,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374693434] [2025-04-26 16:54:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:32,939 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:32,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 16:54:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092867241] [2025-04-26 16:54:32,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:32,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:32,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:32,955 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 16:54:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:33,010 INFO L93 Difference]: Finished difference Result 870 states and 2191 transitions. [2025-04-26 16:54:33,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 870 states and 2191 transitions. [2025-04-26 16:54:33,016 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 44 [2025-04-26 16:54:33,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 870 states to 839 states and 2133 transitions. [2025-04-26 16:54:33,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-04-26 16:54:33,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-04-26 16:54:33,021 INFO L74 IsDeterministic]: Start isDeterministic. Operand 839 states and 2133 transitions. [2025-04-26 16:54:33,022 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:33,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 839 states and 2133 transitions. [2025-04-26 16:54:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 2133 transitions. [2025-04-26 16:54:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 762. [2025-04-26 16:54:33,037 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 16:54:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1987 transitions. [2025-04-26 16:54:33,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 762 states and 1987 transitions. [2025-04-26 16:54:33,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:33,041 INFO L438 stractBuchiCegarLoop]: Abstraction has 762 states and 1987 transitions. [2025-04-26 16:54:33,041 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:33,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 1987 transitions. [2025-04-26 16:54:33,045 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:54:33,045 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:33,045 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:33,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:33,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:33,047 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 16:54:33,047 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 16:54:33,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 448284949, now seen corresponding path program 1 times [2025-04-26 16:54:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725419427] [2025-04-26 16:54:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:33,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:33,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:54:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:54:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 2 times [2025-04-26 16:54:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224483489] [2025-04-26 16:54:33,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:33,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1305109047, now seen corresponding path program 1 times [2025-04-26 16:54:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348466381] [2025-04-26 16:54:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:33,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:33,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:33,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348466381] [2025-04-26 16:54:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348466381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519388286] [2025-04-26 16:54:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:33,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:33,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:33,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:33,124 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 16:54:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:33,168 INFO L93 Difference]: Finished difference Result 1415 states and 3667 transitions. [2025-04-26 16:54:33,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1415 states and 3667 transitions. [2025-04-26 16:54:33,176 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:54:33,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1415 states to 1259 states and 3298 transitions. [2025-04-26 16:54:33,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 381 [2025-04-26 16:54:33,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 381 [2025-04-26 16:54:33,183 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1259 states and 3298 transitions. [2025-04-26 16:54:33,183 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:33,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1259 states and 3298 transitions. [2025-04-26 16:54:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states and 3298 transitions. [2025-04-26 16:54:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 830. [2025-04-26 16:54:33,196 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 16:54:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2137 transitions. [2025-04-26 16:54:33,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 830 states and 2137 transitions. [2025-04-26 16:54:33,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:33,199 INFO L438 stractBuchiCegarLoop]: Abstraction has 830 states and 2137 transitions. [2025-04-26 16:54:33,199 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:33,199 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 830 states and 2137 transitions. [2025-04-26 16:54:33,202 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:54:33,202 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:33,202 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:33,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:33,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:33,202 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 16:54:33,202 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 16:54:33,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1011974451, now seen corresponding path program 1 times [2025-04-26 16:54:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681260943] [2025-04-26 16:54:33,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:33,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:33,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:33,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:33,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 3 times [2025-04-26 16:54:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265063204] [2025-04-26 16:54:33,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:33,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1844841173, now seen corresponding path program 1 times [2025-04-26 16:54:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028827534] [2025-04-26 16:54:33,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:33,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:33,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,371 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:33,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:33,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:33,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:33,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:33,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:33,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:33,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:33,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:33,371 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:33,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,496 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:33,496 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,501 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:54:33,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,515 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,515 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 16:54:33,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,523 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:33,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,538 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,538 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 16:54:33,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,546 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:54:33,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,562 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,562 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 16:54:33,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,570 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:54:33,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,585 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,585 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 16:54:33,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:33,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,593 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:54:33,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,606 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,606 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 16:54:33,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:33,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,616 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:54:33,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,630 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:33,630 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 16:54:33,636 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 16:54:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,638 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:54:33,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:33,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:54:33,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,670 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:54:33,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:33,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:33,789 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:33,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:54:33,794 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:33,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:33,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:33,794 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:33,794 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:33,794 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:33,794 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:33,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp2x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:33,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:33,795 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:33,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,911 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:33,911 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:33,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,913 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:54:33,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:33,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:33,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:33,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:33,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:33,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:33,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:33,928 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:33,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:54:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,935 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:54:33,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:33,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:33,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:33,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:33,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:33,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:33,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:33,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:33,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,957 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:54:33,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:33,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:33,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:33,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:33,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:33,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:33,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:33,972 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:33,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:54:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,979 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:33,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:54:33,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:33,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:33,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:33,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:33,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:33,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:33,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:34,014 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:54:34,014 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,016 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:34,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:54:34,018 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:34,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:54:34,035 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:34,035 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:34,035 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 16:54:34,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:54:34,045 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:34,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:34,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:34,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:34,165 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 16:54:34,166 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 16:54:34,236 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 16:54:34,236 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 16:54:34,237 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 16:54:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-04-26 16:54:34,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:54:34,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:54:34,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,237 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:54:34,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1489 states and 3735 transitions. [2025-04-26 16:54:34,244 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:34,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1489 states to 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:34,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:34,245 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:34,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:34,245 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:34,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:34,245 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:34,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:34,257 INFO L201 PluginConnector]: Adding new model exp2x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:34 BoogieIcfgContainer [2025-04-26 16:54:34,257 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:34,258 INFO L158 Benchmark]: Toolchain (without parser) took 5142.81ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.6MB in the beginning and 44.3MB in the end (delta: 41.3MB). Peak memory consumption was 38.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:34,258 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.63ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:34,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:34,258 INFO L158 Benchmark]: Boogie Preprocessor took 22.23ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:34,258 INFO L158 Benchmark]: RCFGBuilder took 179.95ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:34,258 INFO L158 Benchmark]: BuchiAutomizer took 4904.68ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 44.3MB in the end (delta: 29.3MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2025-04-26 16:54:34,259 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.63ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.23ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 179.95ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4904.68ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 44.3MB in the end (delta: 29.3MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. 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.3s 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: 99ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 284, 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 16:54:34,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...