/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/exp3x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:00,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:00,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:00,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:00,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:00,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:00,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:00,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:00,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:00,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:00,095 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:00,095 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:00,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:00,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:00,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:00,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:00,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:00,097 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:00,097 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:00,097 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:00,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:00,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:00,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:00,316 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:00,317 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:00,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3.wvr.bpl [2025-04-26 18:40:00,318 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3.wvr.bpl' [2025-04-26 18:40:00,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:00,338 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:00,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:00,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:00,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:00,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,369 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:00,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:00,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:00,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:00,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:00,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:00,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:00,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:00,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:00,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/1) ... [2025-04-26 18:40:00,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:00,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:40:00,432 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:00,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:00,432 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:00,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:00,432 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:00,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:00,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:00,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:00,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:00,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:40:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:40:00,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:40:00,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:40:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:40:00,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:40:00,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 18:40:00,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 18:40:00,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 18:40:00,434 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:40:00,474 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:00,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:00,585 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:00,585 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:00,594 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:00,594 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:00,595 INFO L201 PluginConnector]: Adding new model exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:00 BoogieIcfgContainer [2025-04-26 18:40:00,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:00,596 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:00,596 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:00,602 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:00,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:00,602 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:00" (1/2) ... [2025-04-26 18:40:00,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f058d55 and model type exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:00, skipping insertion in model container [2025-04-26 18:40:00,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:00,604 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:00" (2/2) ... [2025-04-26 18:40:00,605 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp3x3.wvr.bpl [2025-04-26 18:40:00,662 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 18:40:00,690 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:00,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:00,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:00,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:40:00,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 53 transitions, 148 flow [2025-04-26 18:40:00,775 INFO L116 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-04-26 18:40:00,776 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 18:40:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 41 events. 6/41 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 18:40:00,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 53 transitions, 148 flow [2025-04-26 18:40:00,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 118 flow [2025-04-26 18:40:00,787 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 54 places, 41 transitions, 118 flow [2025-04-26 18:40:00,787 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 41 transitions, 118 flow [2025-04-26 18:40:01,132 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6831 states, 6829 states have (on average 5.865426856055059) internal successors, (in total 40055), 6830 states have internal predecessors, (40055), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,165 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 6831 states, 6829 states have (on average 5.865426856055059) internal successors, (in total 40055), 6830 states have internal predecessors, (40055), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,167 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:01,829 WARN L140 AmpleReduction]: Number of pruned transitions: 15147 [2025-04-26 18:40:01,830 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:01,830 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3312 [2025-04-26 18:40:01,831 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 18:40:01,831 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3483 [2025-04-26 18:40:01,831 WARN L145 AmpleReduction]: Times succ was already a loop node:9330 [2025-04-26 18:40:01,831 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1420 [2025-04-26 18:40:01,831 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:01,850 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,857 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:01,857 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:01,857 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:01,857 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:01,857 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:01,857 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:01,857 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:01,857 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:01,872 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:02,027 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 18:40:02,027 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,028 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:02,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:02,031 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:02,045 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:02,149 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 18:40:02,149 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,149 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:02,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:02,155 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" [2025-04-26 18:40:02,155 INFO L754 eck$LassoCheckResult]: Loop: "[101] L20-->L21: 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[]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:40:02,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3985, now seen corresponding path program 1 times [2025-04-26 18:40:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705049281] [2025-04-26 18:40:02,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:40:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690762875] [2025-04-26 18:40:02,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash 3832819, now seen corresponding path program 1 times [2025-04-26 18:40:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062282459] [2025-04-26 18:40:02,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:02,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:02,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:02,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,372 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:02,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:02,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:02,372 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:02,373 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:02,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:02,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:02,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:02,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:02,373 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:02,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,531 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:02,538 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:02,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:40:02,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,559 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:02,559 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:02,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:40:02,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:02,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:40:02,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:02,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:02,674 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:02,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,680 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:02,680 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:02,680 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:02,680 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:02,680 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:02,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:02,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:02,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:02,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:02,680 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:02,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:02,772 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:02,775 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:02,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:40:02,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:02,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:02,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:02,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:02,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:02,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:02,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:02,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:02,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:40:02,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:02,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:02,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:02,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:02,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:02,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:02,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:02,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:02,849 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:02,849 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:02,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,853 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:02,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:40:02,856 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:02,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:40:02,873 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:02,874 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:02,874 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -1*x1 + 1*n Supporting invariants [1*x1 - 1 >= 0] [2025-04-26 18:40:02,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:40:02,891 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:02,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:02,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:02,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:02,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:02,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:02,984 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:02,996 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,354 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6831 states, 6829 states have (on average 3.6473861473129303) internal successors, (in total 24908), 6830 states have internal predecessors, (24908), 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 16383 states and 59498 transitions. Complement of second has 8 states. [2025-04-26 18:40:03,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-04-26 18:40:03,363 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:03,363 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,364 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:03,364 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,364 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:40:03,364 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:03,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16383 states and 59498 transitions. [2025-04-26 18:40:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 18:40:03,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16383 states to 9299 states and 33695 transitions. [2025-04-26 18:40:03,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3968 [2025-04-26 18:40:03,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5967 [2025-04-26 18:40:03,817 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9299 states and 33695 transitions. [2025-04-26 18:40:03,817 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:03,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9299 states and 33695 transitions. [2025-04-26 18:40:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states and 33695 transitions. [2025-04-26 18:40:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7969. [2025-04-26 18:40:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7969 states, 7969 states have (on average 3.619400175680763) internal successors, (in total 28843), 7968 states have internal predecessors, (28843), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 28843 transitions. [2025-04-26 18:40:04,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7969 states and 28843 transitions. [2025-04-26 18:40:04,131 INFO L438 stractBuchiCegarLoop]: Abstraction has 7969 states and 28843 transitions. [2025-04-26 18:40:04,131 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:04,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7969 states and 28843 transitions. [2025-04-26 18:40:04,183 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 18:40:04,183 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,183 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:04,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:04,184 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:04,184 INFO L754 eck$LassoCheckResult]: Loop: "[105] L28-->L29: 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[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:04,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash 118816523, now seen corresponding path program 1 times [2025-04-26 18:40:04,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491697401] [2025-04-26 18:40:04,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:04,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:04,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 18:40:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21488458] [2025-04-26 18:40:04,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1781435027, now seen corresponding path program 1 times [2025-04-26 18:40:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647109911] [2025-04-26 18:40:04,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:04,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:04,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647109911] [2025-04-26 18:40:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647109911] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:04,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:04,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510288864] [2025-04-26 18:40:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:04,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:04,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:04,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:04,289 INFO L87 Difference]: Start difference. First operand 7969 states and 28843 transitions. cyclomatic complexity: 22109 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:04,476 INFO L93 Difference]: Finished difference Result 8850 states and 31406 transitions. [2025-04-26 18:40:04,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8850 states and 31406 transitions. [2025-04-26 18:40:04,557 INFO L131 ngComponentsAnalysis]: Automaton has 1148 accepting balls. 4766 [2025-04-26 18:40:04,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8850 states to 8850 states and 31406 transitions. [2025-04-26 18:40:04,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5516 [2025-04-26 18:40:04,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5516 [2025-04-26 18:40:04,663 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8850 states and 31406 transitions. [2025-04-26 18:40:04,663 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:04,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8850 states and 31406 transitions. [2025-04-26 18:40:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states and 31406 transitions. [2025-04-26 18:40:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 7972. [2025-04-26 18:40:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7972 states, 7972 states have (on average 3.6184144505770197) internal successors, (in total 28846), 7971 states have internal predecessors, (28846), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7972 states to 7972 states and 28846 transitions. [2025-04-26 18:40:04,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7972 states and 28846 transitions. [2025-04-26 18:40:04,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:04,967 INFO L438 stractBuchiCegarLoop]: Abstraction has 7972 states and 28846 transitions. [2025-04-26 18:40:04,967 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:04,967 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7972 states and 28846 transitions. [2025-04-26 18:40:05,000 INFO L131 ngComponentsAnalysis]: Automaton has 903 accepting balls. 3906 [2025-04-26 18:40:05,000 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:05,000 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:05,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:05,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:05,001 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: 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[]" "[126] L69-1-->L28: 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]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[100] L20-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:05,001 INFO L754 eck$LassoCheckResult]: Loop: "[105] L28-->L29: 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[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:40:05,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash -611602841, now seen corresponding path program 1 times [2025-04-26 18:40:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777686753] [2025-04-26 18:40:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:05,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:05,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:05,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:05,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 2 times [2025-04-26 18:40:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512139863] [2025-04-26 18:40:05,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:05,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:05,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:05,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:05,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 660192713, now seen corresponding path program 1 times [2025-04-26 18:40:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734695080] [2025-04-26 18:40:05,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:05,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:05,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:05,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,131 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,131 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,131 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,131 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,131 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:05,131 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,131 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,131 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,131 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:05,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,132 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,229 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:05,230 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:05,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:40:05,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,249 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,249 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,254 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 18:40:05,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:40:05,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,268 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,268 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:05,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:40:05,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,296 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,297 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x6=1, x5=1} Honda state: {x6=1, x5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,308 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:40:05,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,321 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:05,321 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:05,326 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 18:40:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,328 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:40:05,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:05,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:40:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:40:05,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:05,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:05,442 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:05,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:40:05,447 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,447 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:05,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:05,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,447 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,539 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:05,540 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,543 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:40:05,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:05,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:05,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:05,563 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:05,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:05,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,571 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:40:05,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 18:40:05,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:05,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:05,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:05,591 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:05,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:05,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,598 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:40:05,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:05,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:05,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:05,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:05,619 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:05,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:05,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:40:05,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:05,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:05,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:05,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:05,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:05,656 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:05,656 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,658 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:05,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:40:05,660 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:05,677 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 18:40:05,677 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:05,677 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:05,677 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, n) = -1*x2 + 1*n Supporting invariants [1*x2 - 1 >= 0] [2025-04-26 18:40:05,685 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 18:40:05,688 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:05,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:05,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:05,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,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 18:40:05,785 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:05,785 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7972 states and 28846 transitions. cyclomatic complexity: 22109 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,055 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7972 states and 28846 transitions. cyclomatic complexity: 22109. 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 18608 states and 71901 transitions. Complement of second has 7 states. [2025-04-26 18:40:06,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-26 18:40:06,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:06,057 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:40:06,057 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:40:06,057 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18608 states and 71901 transitions. [2025-04-26 18:40:06,197 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 18:40:06,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18608 states to 14220 states and 52185 transitions. [2025-04-26 18:40:06,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5213 [2025-04-26 18:40:06,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7690 [2025-04-26 18:40:06,412 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14220 states and 52185 transitions. [2025-04-26 18:40:06,412 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:06,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14220 states and 52185 transitions. [2025-04-26 18:40:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14220 states and 52185 transitions. [2025-04-26 18:40:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14220 to 11423. [2025-04-26 18:40:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11423 states, 11423 states have (on average 3.7874463801103038) internal successors, (in total 43264), 11422 states have internal predecessors, (43264), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11423 states to 11423 states and 43264 transitions. [2025-04-26 18:40:06,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11423 states and 43264 transitions. [2025-04-26 18:40:06,728 INFO L438 stractBuchiCegarLoop]: Abstraction has 11423 states and 43264 transitions. [2025-04-26 18:40:06,728 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:06,728 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11423 states and 43264 transitions. [2025-04-26 18:40:06,797 INFO L131 ngComponentsAnalysis]: Automaton has 580 accepting balls. 2030 [2025-04-26 18:40:06,797 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:06,797 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:06,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:06,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:06,798 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 18:40:06,798 INFO L754 eck$LassoCheckResult]: Loop: "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" [2025-04-26 18:40:06,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 610088148, now seen corresponding path program 1 times [2025-04-26 18:40:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769166373] [2025-04-26 18:40:06,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:06,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:06,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:06,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 18:40:06,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763691767] [2025-04-26 18:40:06,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:06,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:06,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:06,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:06,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2115805834, now seen corresponding path program 1 times [2025-04-26 18:40:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776383057] [2025-04-26 18:40:06,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:06,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:06,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:06,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,992 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:06,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:06,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:06,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:06,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:06,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:06,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:06,993 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:06,993 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:06,993 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:06,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,089 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:07,089 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,093 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:40:07,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,115 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:07,115 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x6=1, x5=1} Honda state: {x6=1, x5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:07,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:40:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,122 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:40:07,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,134 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:07,135 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:07,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,141 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:40:07,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,154 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:07,154 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:07,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:40:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,161 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:40:07,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,173 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:07,173 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:07,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:40:07,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,180 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:40:07,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:07,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:40:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,207 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:40:07,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:07,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:07,298 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:07,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:40:07,302 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:07,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:07,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:07,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:07,303 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:07,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:07,303 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:07,303 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:07,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:07,303 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:07,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:07,396 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:07,396 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,398 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:40:07,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:07,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:40:07,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:40:07,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:07,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,436 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:40:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,445 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:40:07,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:07,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:07,473 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:07,473 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,475 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:07,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:40:07,477 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:07,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,494 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:07,494 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:07,494 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 1*n - 1*x3 Supporting invariants [1*x3 - 1 >= 0] [2025-04-26 18:40:07,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:40:07,504 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:07,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:07,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:07,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:07,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:07,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:07,608 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:07,608 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11423 states and 43264 transitions. cyclomatic complexity: 33012 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:07,913 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11423 states and 43264 transitions. cyclomatic complexity: 33012. 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 31177 states and 119689 transitions. Complement of second has 7 states. [2025-04-26 18:40:07,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-26 18:40:07,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:40:07,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:40:07,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,914 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:40:07,914 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31177 states and 119689 transitions. [2025-04-26 18:40:08,290 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 18:40:08,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31177 states to 18684 states and 70064 transitions. [2025-04-26 18:40:08,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5208 [2025-04-26 18:40:08,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6208 [2025-04-26 18:40:08,471 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18684 states and 70064 transitions. [2025-04-26 18:40:08,471 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:08,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18684 states and 70064 transitions. [2025-04-26 18:40:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18684 states and 70064 transitions. [2025-04-26 18:40:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18684 to 17280. [2025-04-26 18:40:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17280 states, 17280 states have (on average 3.6591435185185186) internal successors, (in total 63230), 17279 states have internal predecessors, (63230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17280 states to 17280 states and 63230 transitions. [2025-04-26 18:40:08,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17280 states and 63230 transitions. [2025-04-26 18:40:08,900 INFO L438 stractBuchiCegarLoop]: Abstraction has 17280 states and 63230 transitions. [2025-04-26 18:40:08,900 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:08,900 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17280 states and 63230 transitions. [2025-04-26 18:40:09,103 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 18:40:09,103 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:09,103 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:09,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:09,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:09,104 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: 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[]" "[126] L69-1-->L28: 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]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: 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]" "[100] L20-->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[]" "[132] L71-->L44: 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]" "[104] L28-->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[]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" [2025-04-26 18:40:09,105 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: 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[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:09,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1183302104, now seen corresponding path program 1 times [2025-04-26 18:40:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:09,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306877514] [2025-04-26 18:40:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:09,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:09,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:09,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306877514] [2025-04-26 18:40:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306877514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:09,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:40:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436529620] [2025-04-26 18:40:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:09,171 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:09,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-04-26 18:40:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:09,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335742120] [2025-04-26 18:40:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:09,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:09,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:09,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:09,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:09,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:09,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:09,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:09,187 INFO L87 Difference]: Start difference. First operand 17280 states and 63230 transitions. cyclomatic complexity: 47279 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:09,440 INFO L93 Difference]: Finished difference Result 21661 states and 76730 transitions. [2025-04-26 18:40:09,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21661 states and 76730 transitions. [2025-04-26 18:40:09,652 INFO L131 ngComponentsAnalysis]: Automaton has 490 accepting balls. 1400 [2025-04-26 18:40:09,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21661 states to 20866 states and 74391 transitions. [2025-04-26 18:40:09,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6370 [2025-04-26 18:40:09,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6370 [2025-04-26 18:40:09,988 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20866 states and 74391 transitions. [2025-04-26 18:40:09,988 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:09,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20866 states and 74391 transitions. [2025-04-26 18:40:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20866 states and 74391 transitions. [2025-04-26 18:40:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20866 to 18936. [2025-04-26 18:40:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18936 states, 18936 states have (on average 3.6452788339670468) internal successors, (in total 69027), 18935 states have internal predecessors, (69027), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18936 states to 18936 states and 69027 transitions. [2025-04-26 18:40:10,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18936 states and 69027 transitions. [2025-04-26 18:40:10,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:10,451 INFO L438 stractBuchiCegarLoop]: Abstraction has 18936 states and 69027 transitions. [2025-04-26 18:40:10,451 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:10,451 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18936 states and 69027 transitions. [2025-04-26 18:40:10,547 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 18:40:10,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:10,547 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:10,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:10,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:10,548 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: 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]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 18:40:10,548 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: 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[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:10,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1165472274, now seen corresponding path program 1 times [2025-04-26 18:40:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039158355] [2025-04-26 18:40:10,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:10,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:10,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:10,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:10,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 2 times [2025-04-26 18:40:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558775894] [2025-04-26 18:40:10,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:10,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:10,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:10,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:10,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:10,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:10,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:10,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 967612560, now seen corresponding path program 1 times [2025-04-26 18:40:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:10,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714736472] [2025-04-26 18:40:10,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:10,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:10,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:10,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714736472] [2025-04-26 18:40:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714736472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999725614] [2025-04-26 18:40:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:10,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:10,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:10,612 INFO L87 Difference]: Start difference. First operand 18936 states and 69027 transitions. cyclomatic complexity: 51549 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:10,913 INFO L93 Difference]: Finished difference Result 35932 states and 129671 transitions. [2025-04-26 18:40:10,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35932 states and 129671 transitions. [2025-04-26 18:40:11,435 INFO L131 ngComponentsAnalysis]: Automaton has 511 accepting balls. 1372 [2025-04-26 18:40:11,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35932 states to 33833 states and 122985 transitions. [2025-04-26 18:40:11,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10785 [2025-04-26 18:40:11,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10785 [2025-04-26 18:40:11,824 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33833 states and 122985 transitions. [2025-04-26 18:40:11,825 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:11,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33833 states and 122985 transitions. [2025-04-26 18:40:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33833 states and 122985 transitions. [2025-04-26 18:40:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33833 to 21983. [2025-04-26 18:40:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21983 states, 21983 states have (on average 3.669335395532912) internal successors, (in total 80663), 21982 states have internal predecessors, (80663), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21983 states to 21983 states and 80663 transitions. [2025-04-26 18:40:12,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21983 states and 80663 transitions. [2025-04-26 18:40:12,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:12,411 INFO L438 stractBuchiCegarLoop]: Abstraction has 21983 states and 80663 transitions. [2025-04-26 18:40:12,411 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:40:12,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21983 states and 80663 transitions. [2025-04-26 18:40:12,507 INFO L131 ngComponentsAnalysis]: Automaton has 339 accepting balls. 966 [2025-04-26 18:40:12,507 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:12,507 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:12,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:12,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:12,508 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: 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]" "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[132] L71-->L44: 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]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" [2025-04-26 18:40:12,508 INFO L754 eck$LassoCheckResult]: Loop: "[113] L44-->L45: 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[]" "[115] L45-->L44: Formula: (= (* v_x4_5 2) v_x4_4) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" [2025-04-26 18:40:12,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1769851736, now seen corresponding path program 1 times [2025-04-26 18:40:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309199389] [2025-04-26 18:40:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:12,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:12,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:12,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:12,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 3 times [2025-04-26 18:40:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335414709] [2025-04-26 18:40:12,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:12,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:12,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:12,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:12,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -20465462, now seen corresponding path program 1 times [2025-04-26 18:40:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772609305] [2025-04-26 18:40:12,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:12,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:12,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:12,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,681 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:12,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:12,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:12,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:12,681 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:12,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:12,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:12,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:12,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:40:12,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:12,681 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:12,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,804 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:12,804 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:12,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:12,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:12,808 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:12,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:40:12,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:12,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:12,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:40:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:12,837 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:40:12,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:12,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:12,934 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:12,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:40:12,939 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:12,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:12,939 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:12,939 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:12,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:12,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:12,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:12,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:12,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:40:12,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:12,940 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:12,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:13,071 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:13,071 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:13,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:13,073 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:13,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:40:13,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:13,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:13,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:13,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:13,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:13,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:13,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:13,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:13,100 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:13,100 INFO L437 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:13,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:13,102 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:13,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:40:13,103 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:13,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:40:13,119 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:13,119 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:13,119 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x4) = 1*n - 1*x4 Supporting invariants [1*x4 - 1 >= 0] [2025-04-26 18:40:13,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:40:13,126 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:13,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:13,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:13,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:13,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:13,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:13,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:13,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:13,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:13,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:13,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:13,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:13,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:13,252 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:13,252 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21983 states and 80663 transitions. cyclomatic complexity: 60451 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:13,661 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21983 states and 80663 transitions. cyclomatic complexity: 60451. 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 40406 states and 146650 transitions. Complement of second has 7 states. [2025-04-26 18:40:13,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-26 18:40:13,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:13,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:13,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:40:13,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:13,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 110 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:40:13,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:13,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40406 states and 146650 transitions. [2025-04-26 18:40:14,098 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 18:40:14,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40406 states to 28842 states and 102569 transitions. [2025-04-26 18:40:14,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8332 [2025-04-26 18:40:14,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9324 [2025-04-26 18:40:14,290 INFO L74 IsDeterministic]: Start isDeterministic. Operand 28842 states and 102569 transitions. [2025-04-26 18:40:14,290 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:14,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28842 states and 102569 transitions. [2025-04-26 18:40:14,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28842 states and 102569 transitions. [2025-04-26 18:40:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28842 to 25206. [2025-04-26 18:40:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25206 states, 25206 states have (on average 3.6002539077997304) internal successors, (in total 90748), 25205 states have internal predecessors, (90748), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25206 states to 25206 states and 90748 transitions. [2025-04-26 18:40:14,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25206 states and 90748 transitions. [2025-04-26 18:40:14,939 INFO L438 stractBuchiCegarLoop]: Abstraction has 25206 states and 90748 transitions. [2025-04-26 18:40:14,939 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:40:14,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25206 states and 90748 transitions. [2025-04-26 18:40:15,233 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 406 [2025-04-26 18:40:15,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:15,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:15,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:15,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:15,235 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: 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]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: 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]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[114] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" [2025-04-26 18:40:15,235 INFO L754 eck$LassoCheckResult]: Loop: "[117] L52-->L53: Formula: (< v_x5_6 v_n_10) InVars {x5=v_x5_6, n=v_n_10} OutVars{x5=v_x5_6, n=v_n_10} AuxVars[] AssignedVars[]" "[119] L53-->L52: Formula: (= v_x5_3 (* v_x5_4 2)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 18:40:15,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -68782569, now seen corresponding path program 1 times [2025-04-26 18:40:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:15,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536209639] [2025-04-26 18:40:15,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:15,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:15,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:15,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:15,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:15,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:15,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:15,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash 4707, now seen corresponding path program 1 times [2025-04-26 18:40:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:15,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967872261] [2025-04-26 18:40:15,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:15,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:15,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:15,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:15,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:15,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:15,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1675535623, now seen corresponding path program 1 times [2025-04-26 18:40:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:15,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264845455] [2025-04-26 18:40:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:15,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:15,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:15,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:15,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:15,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:15,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:15,411 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:15,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:15,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:15,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:15,411 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:15,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:15,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:15,412 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:40:15,412 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:15,412 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:15,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,552 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:15,552 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,554 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:40:15,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,568 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,569 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar0=0} Honda state: {thread3Thread1of1ForFork1_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:15,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,576 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:40:15,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,587 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,588 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 18:40:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,594 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:40:15,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,608 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,608 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,615 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:40:15,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,627 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,627 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:40:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,634 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:40:15,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,648 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,648 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 18:40:15,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,654 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:40:15,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,666 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,667 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar2=0} Honda state: {thread3Thread1of1ForFork1_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:40:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,674 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:40:15,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,685 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:15,686 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread4Thread1of1ForFork2_thidvar3=0} Honda state: {thread4Thread1of1ForFork2_thidvar3=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:15,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,692 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:40:15,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:15,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:40:15,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,719 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:40:15,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:15,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:15,789 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:15,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:40:15,793 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:15,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:15,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:15,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:15,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:15,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:15,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:15,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:40:15,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:15,793 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:15,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:15,919 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:15,919 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,928 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:40:15,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:15,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:15,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:15,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:15,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:15,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:15,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:15,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:15,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 18:40:15,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,952 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:40:15,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:15,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:15,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:15,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:15,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:15,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:15,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:15,967 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:15,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,975 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:40:15,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:15,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:15,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:15,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:15,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:15,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:15,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:15,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:15,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:40:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:15,997 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:15,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:40:16,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,015 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:16,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,022 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:40:16,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,037 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:40:16,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,044 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:40:16,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,059 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:40:16,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,066 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:40:16,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,081 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,088 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:40:16,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,102 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:16,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,109 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:40:16,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,124 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:16,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,131 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:40:16,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:16,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:16,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:16,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:16,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:16,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:16,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:16,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:16,166 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 18:40:16,166 INFO L437 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 18:40:16,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:16,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:16,168 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:16,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:40:16,169 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:16,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 18:40:16,185 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:16,186 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:16,186 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x5) = 1*n - 1*x5 Supporting invariants [1*x5 - 1 >= 0] [2025-04-26 18:40:16,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:40:16,193 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:16,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:16,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:16,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:16,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:16,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:16,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:40:16,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:16,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:16,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:16,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:16,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:16,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:16,305 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:16,306 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25206 states and 90748 transitions. cyclomatic complexity: 67405 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:16,804 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25206 states and 90748 transitions. cyclomatic complexity: 67405. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 63811 states and 228095 transitions. Complement of second has 7 states. [2025-04-26 18:40:16,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-04-26 18:40:16,805 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:40:16,805 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:16,805 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:40:16,805 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:16,805 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 104 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:40:16,806 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:16,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63811 states and 228095 transitions. [2025-04-26 18:40:17,605 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:17,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63811 states to 29942 states and 105242 transitions. [2025-04-26 18:40:17,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6843 [2025-04-26 18:40:17,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7094 [2025-04-26 18:40:17,805 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29942 states and 105242 transitions. [2025-04-26 18:40:17,805 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:17,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29942 states and 105242 transitions. [2025-04-26 18:40:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29942 states and 105242 transitions. [2025-04-26 18:40:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29942 to 28653. [2025-04-26 18:40:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28653 states, 28653 states have (on average 3.412487348619691) internal successors, (in total 97778), 28652 states have internal predecessors, (97778), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28653 states to 28653 states and 97778 transitions. [2025-04-26 18:40:18,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28653 states and 97778 transitions. [2025-04-26 18:40:18,425 INFO L438 stractBuchiCegarLoop]: Abstraction has 28653 states and 97778 transitions. [2025-04-26 18:40:18,425 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:40:18,426 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28653 states and 97778 transitions. [2025-04-26 18:40:18,547 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:18,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:18,547 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:18,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:18,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:18,548 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: 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]" "[109] L36-->L37: Formula: (< v_x3_3 v_n_5) InVars {n=v_n_5, x3=v_x3_3} OutVars{n=v_n_5, x3=v_x3_3} AuxVars[] AssignedVars[]" "[132] L71-->L44: 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]" "[111] L37-->L36: Formula: (= (* v_x3_5 2) v_x3_4) InVars {x3=v_x3_5} OutVars{x3=v_x3_4} AuxVars[] AssignedVars[x3]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 18:40:18,548 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 18:40:18,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1832339301, now seen corresponding path program 1 times [2025-04-26 18:40:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:18,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237012242] [2025-04-26 18:40:18,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:18,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:18,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237012242] [2025-04-26 18:40:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237012242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:18,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:18,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:40:18,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228741170] [2025-04-26 18:40:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:18,588 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:18,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-04-26 18:40:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:18,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294142113] [2025-04-26 18:40:18,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:18,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:18,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:18,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:18,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:18,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:18,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:18,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:18,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:18,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:18,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:18,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:18,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:18,601 INFO L87 Difference]: Start difference. First operand 28653 states and 97778 transitions. cyclomatic complexity: 71058 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:19,104 INFO L93 Difference]: Finished difference Result 45826 states and 154102 transitions. [2025-04-26 18:40:19,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45826 states and 154102 transitions. [2025-04-26 18:40:19,561 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 252 [2025-04-26 18:40:20,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45826 states to 44188 states and 149005 transitions. [2025-04-26 18:40:20,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10766 [2025-04-26 18:40:20,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10766 [2025-04-26 18:40:20,036 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44188 states and 149005 transitions. [2025-04-26 18:40:20,036 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:20,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44188 states and 149005 transitions. [2025-04-26 18:40:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44188 states and 149005 transitions. [2025-04-26 18:40:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44188 to 31651. [2025-04-26 18:40:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31651 states, 31651 states have (on average 3.397207039272061) internal successors, (in total 107525), 31650 states have internal predecessors, (107525), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31651 states to 31651 states and 107525 transitions. [2025-04-26 18:40:20,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31651 states and 107525 transitions. [2025-04-26 18:40:20,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:20,724 INFO L438 stractBuchiCegarLoop]: Abstraction has 31651 states and 107525 transitions. [2025-04-26 18:40:20,724 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:40:20,724 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31651 states and 107525 transitions. [2025-04-26 18:40:20,863 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:20,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:20,864 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:20,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:20,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:20,865 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: 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[]" "[126] L69-1-->L28: 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]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: 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]" "[100] L20-->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[]" "[132] L71-->L44: 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]" "[105] L28-->L29: 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[]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[104] L28-->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[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 18:40:20,865 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 18:40:20,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1082432591, now seen corresponding path program 1 times [2025-04-26 18:40:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:20,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623336709] [2025-04-26 18:40:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:20,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:20,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:20,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:20,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:20,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 2 times [2025-04-26 18:40:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:20,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338436407] [2025-04-26 18:40:20,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:20,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:20,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:20,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:20,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:20,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:20,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:20,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:20,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -835630445, now seen corresponding path program 1 times [2025-04-26 18:40:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:20,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776969883] [2025-04-26 18:40:20,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:20,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:40:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:40:20,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:20,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776969883] [2025-04-26 18:40:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776969883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612480206] [2025-04-26 18:40:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:20,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:20,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:20,929 INFO L87 Difference]: Start difference. First operand 31651 states and 107525 transitions. cyclomatic complexity: 77984 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:21,506 INFO L93 Difference]: Finished difference Result 59490 states and 203529 transitions. [2025-04-26 18:40:21,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59490 states and 203529 transitions. [2025-04-26 18:40:22,235 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:22,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59490 states to 53258 states and 182679 transitions. [2025-04-26 18:40:22,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12453 [2025-04-26 18:40:22,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12453 [2025-04-26 18:40:22,852 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53258 states and 182679 transitions. [2025-04-26 18:40:22,852 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:22,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53258 states and 182679 transitions. [2025-04-26 18:40:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53258 states and 182679 transitions. [2025-04-26 18:40:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53258 to 35014. [2025-04-26 18:40:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35014 states, 35014 states have (on average 3.357000057120009) internal successors, (in total 117542), 35013 states have internal predecessors, (117542), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35014 states to 35014 states and 117542 transitions. [2025-04-26 18:40:23,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35014 states and 117542 transitions. [2025-04-26 18:40:23,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:23,598 INFO L438 stractBuchiCegarLoop]: Abstraction has 35014 states and 117542 transitions. [2025-04-26 18:40:23,598 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:40:23,598 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35014 states and 117542 transitions. [2025-04-26 18:40:23,747 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:23,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:23,747 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:23,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:23,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:23,748 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[101] L20-->L21: 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[]" "[126] L69-1-->L28: 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]" "[103] L21-->L20: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[129] L70-->L36: 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]" "[100] L20-->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[]" "[132] L71-->L44: 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]" "[105] L28-->L29: 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[]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[107] L29-->L28: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[104] L28-->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[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 18:40:23,749 INFO L754 eck$LassoCheckResult]: Loop: "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" [2025-04-26 18:40:23,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash 804328318, now seen corresponding path program 1 times [2025-04-26 18:40:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062298043] [2025-04-26 18:40:23,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:40:23,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:40:23,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:23,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062298043] [2025-04-26 18:40:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062298043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:23,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:40:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953212739] [2025-04-26 18:40:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:23,789 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:23,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 4895, now seen corresponding path program 3 times [2025-04-26 18:40:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388690434] [2025-04-26 18:40:23,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:23,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:23,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:23,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:23,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:23,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:23,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:23,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:23,802 INFO L87 Difference]: Start difference. First operand 35014 states and 117542 transitions. cyclomatic complexity: 85031 Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:24,303 INFO L93 Difference]: Finished difference Result 57945 states and 197985 transitions. [2025-04-26 18:40:24,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57945 states and 197985 transitions. [2025-04-26 18:40:24,990 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:25,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57945 states to 49812 states and 172267 transitions. [2025-04-26 18:40:25,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10975 [2025-04-26 18:40:25,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10975 [2025-04-26 18:40:25,433 INFO L74 IsDeterministic]: Start isDeterministic. Operand 49812 states and 172267 transitions. [2025-04-26 18:40:25,433 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:25,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49812 states and 172267 transitions. [2025-04-26 18:40:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49812 states and 172267 transitions. [2025-04-26 18:40:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49812 to 31658. [2025-04-26 18:40:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31658 states, 31658 states have (on average 3.3943710910354414) internal successors, (in total 107459), 31657 states have internal predecessors, (107459), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31658 states to 31658 states and 107459 transitions. [2025-04-26 18:40:26,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31658 states and 107459 transitions. [2025-04-26 18:40:26,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:26,214 INFO L438 stractBuchiCegarLoop]: Abstraction has 31658 states and 107459 transitions. [2025-04-26 18:40:26,214 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:40:26,214 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31658 states and 107459 transitions. [2025-04-26 18:40:26,476 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 126 [2025-04-26 18:40:26,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:26,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:26,477 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L69: Formula: (and (< 0 v_x1_5) (< 0 v_x3_1) (< 0 v_x5_1) (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_5 v_x1_5)) InVars {x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} OutVars{x1=v_x1_5, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[141] L69-->L20: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[100] L20-->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[]" "[102] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[126] L69-1-->L28: 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]" "[104] L28-->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[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[129] L70-->L36: 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]" "[108] L36-->thread3FINAL: Formula: (<= v_n_6 v_x3_6) InVars {n=v_n_6, x3=v_x3_6} OutVars{n=v_n_6, x3=v_x3_6} AuxVars[] AssignedVars[]" "[110] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] L71-->L44: 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]" "[112] L44-->thread4FINAL: Formula: (<= v_n_8 v_x4_6) InVars {x4=v_x4_6, n=v_n_8} OutVars{x4=v_x4_6, n=v_n_8} AuxVars[] AssignedVars[]" "[114] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] L72-->L52: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[117] L52-->L53: Formula: (< v_x5_6 v_n_10) InVars {x5=v_x5_6, n=v_n_10} OutVars{x5=v_x5_6, n=v_n_10} AuxVars[] AssignedVars[]" "[138] L73-->L60: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[119] L53-->L52: Formula: (= v_x5_3 (* v_x5_4 2)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" "[116] L52-->thread5FINAL: Formula: (<= v_n_9 v_x5_5) InVars {x5=v_x5_5, n=v_n_9} OutVars{x5=v_x5_5, n=v_n_9} AuxVars[] AssignedVars[]" [2025-04-26 18:40:26,477 INFO L754 eck$LassoCheckResult]: Loop: "[121] L60-->L61: Formula: (< v_x6_3 v_n_11) InVars {x6=v_x6_3, n=v_n_11} OutVars{x6=v_x6_3, n=v_n_11} AuxVars[] AssignedVars[]" "[123] L61-->L60: Formula: (= v_x6_4 (* v_x6_5 2)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 18:40:26,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 423024361, now seen corresponding path program 1 times [2025-04-26 18:40:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389648313] [2025-04-26 18:40:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:40:26,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:40:26,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:40:26,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:40:26,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 4 times [2025-04-26 18:40:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775713567] [2025-04-26 18:40:26,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:40:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:40:26,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:26,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:40:26,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:26,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:26,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1495478325, now seen corresponding path program 1 times [2025-04-26 18:40:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444760940] [2025-04-26 18:40:26,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:40:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:40:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:40:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:40:26,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,731 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:26,731 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:26,731 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:26,731 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:26,731 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:26,731 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:26,732 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:26,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 18:40:26,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:26,732 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:26,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,898 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:26,898 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,900 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:26,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:40:26,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:26,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:26,912 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:26,912 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork1_thidvar1=0} Honda state: {thread3Thread1of1ForFork1_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:26,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 18:40:26,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,920 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:26,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:40:26,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:26,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:26,935 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:26,935 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork5_thidvar0=0} Honda state: {thread1Thread1of1ForFork5_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:40:26,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:26,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,942 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:26,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 18:40:26,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:26,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:26,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 18:40:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,971 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:26,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 18:40:26,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:26,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:27,068 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:27,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,090 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:27,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:27,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:27,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:27,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:27,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:27,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:27,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp3x3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 18:40:27,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:27,090 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:27,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:27,272 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:27,273 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,274 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 18:40:27,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:27,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,289 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,297 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 18:40:27,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:27,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 18:40:27,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,319 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 18:40:27,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:27,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,334 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 18:40:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,341 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:40:27,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:27,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:27,377 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:40:27,378 INFO L437 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:27,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,379 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:40:27,381 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:27,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 18:40:27,397 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:40:27,397 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:27,397 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x6, n) = -1*x6 + 1*n Supporting invariants [1*x6 - 1 >= 0] [2025-04-26 18:40:27,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 18:40:27,404 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:27,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:40:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:40:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:27,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:40:27,533 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31658 states and 107459 transitions. cyclomatic complexity: 77911 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,977 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31658 states and 107459 transitions. cyclomatic complexity: 77911. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 57459 states and 191945 transitions. Complement of second has 7 states. [2025-04-26 18:40:27,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-04-26 18:40:27,978 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 18:40:27,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 18:40:27,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 102 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 18:40:27,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57459 states and 191945 transitions. [2025-04-26 18:40:28,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:28,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57459 states to 0 states and 0 transitions. [2025-04-26 18:40:28,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:28,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:28,528 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:28,528 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:28,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:28,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:28,529 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:28,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:40:28,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:28,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:28,529 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:28,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:40:28,540 INFO L201 PluginConnector]: Adding new model exp3x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:28 BoogieIcfgContainer [2025-04-26 18:40:28,540 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:28,540 INFO L158 Benchmark]: Toolchain (without parser) took 28202.47ms. Allocated memory was 163.6MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 89.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-26 18:40:28,541 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:28,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.69ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 87.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:28,541 INFO L158 Benchmark]: Boogie Preprocessor took 17.43ms. Allocated memory is still 163.6MB. Free memory was 87.3MB in the beginning and 86.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,541 INFO L158 Benchmark]: RCFGBuilder took 205.42ms. Allocated memory is still 163.6MB. Free memory was 86.3MB in the beginning and 76.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,541 INFO L158 Benchmark]: BuchiAutomizer took 27944.32ms. Allocated memory was 163.6MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 76.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-26 18:40:28,542 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.16ms. Allocated memory is still 163.6MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.69ms. Allocated memory is still 163.6MB. Free memory was 89.2MB in the beginning and 87.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.43ms. Allocated memory is still 163.6MB. Free memory was 87.3MB in the beginning and 86.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 205.42ms. Allocated memory is still 163.6MB. Free memory was 86.3MB in the beginning and 76.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 27944.32ms. Allocated memory was 163.6MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 76.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.8s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.5s. Büchi inclusion checks took 13.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 5.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 74049 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 8.2s Buchi closure took 0.3s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 369 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 1.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 1144, Number of transitions in reduction automaton: 24908, Number of states in reduction automaton: 6831, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 6 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. One deterministic module has affine ranking function -1 * x5 + n and consists of 5 locations. One deterministic module has affine ranking function n + -1 * x6 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:28,553 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...