/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/popl20/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:42,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:42,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:42,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:42,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:42,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:42,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:42,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:42,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:42,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:42,610 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:42,610 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:42,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:42,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:42,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:42,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:42,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:42,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:42,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:42,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:42,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:42,614 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:42,614 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:42,614 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:42,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:42,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:42,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:42,831 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:42,831 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:42,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2025-04-26 18:41:42,834 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2025-04-26 18:41:42,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:42,848 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:42,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:42,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:42,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:42,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,886 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:42,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:42,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:42,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:42,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:42,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:42,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:42,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:42,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:42,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/1) ... [2025-04-26 18:41:42,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:42,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:42,942 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:41:42,946 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:41:42,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:42,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:42,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:42,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:42,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:42,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:42,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:42,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:42,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:42,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:42,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:42,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:42,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:42,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:42,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:42,969 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:41:43,008 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:43,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:43,125 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:43,125 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:43,144 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:43,144 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:43,145 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:43 BoogieIcfgContainer [2025-04-26 18:41:43,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:43,145 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:43,145 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:43,152 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:43,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:43,153 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:42" (1/2) ... [2025-04-26 18:41:43,156 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2c5afc and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:43, skipping insertion in model container [2025-04-26 18:41:43,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:43,157 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:43" (2/2) ... [2025-04-26 18:41:43,158 INFO L376 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-04-26 18:41:43,211 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:43,254 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:43,256 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:41:43,259 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:41:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 18:41:43,343 INFO L116 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-04-26 18:41:43,347 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:43,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-04-26 18:41:43,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 116 flow [2025-04-26 18:41:43,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2025-04-26 18:41:43,358 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 36 transitions, 96 flow [2025-04-26 18:41:43,358 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 36 transitions, 96 flow [2025-04-26 18:41:43,421 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 755 states, 753 states have (on average 3.634794156706507) internal successors, (in total 2737), 754 states have internal predecessors, (2737), 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:41:43,424 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 755 states, 753 states have (on average 3.634794156706507) internal successors, (in total 2737), 754 states have internal predecessors, (2737), 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:41:43,426 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:43,643 WARN L140 AmpleReduction]: Number of pruned transitions: 1093 [2025-04-26 18:41:43,644 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:43,644 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 104 [2025-04-26 18:41:43,644 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:71 [2025-04-26 18:41:43,644 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:436 [2025-04-26 18:41:43,644 WARN L145 AmpleReduction]: Times succ was already a loop node:79 [2025-04-26 18:41:43,644 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:168 [2025-04-26 18:41:43,644 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:43,646 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 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:41:43,652 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:43,653 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:43,653 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:43,653 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:43,653 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:43,653 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:43,653 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:43,653 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:43,655 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 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:41:43,686 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 494 [2025-04-26 18:41:43,689 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:43,689 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:43,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:43,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:43,693 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:43,694 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 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:41:43,704 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 494 [2025-04-26 18:41:43,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:43,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:43,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:43,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:43,709 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:43,709 INFO L754 eck$LassoCheckResult]: Loop: "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" [2025-04-26 18:41:43,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1102579250, now seen corresponding path program 1 times [2025-04-26 18:41:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120232083] [2025-04-26 18:41:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:43,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:43,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:43,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:43,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 123198, now seen corresponding path program 1 times [2025-04-26 18:41:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790500048] [2025-04-26 18:41:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:43,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:43,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:43,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash 971536465, now seen corresponding path program 1 times [2025-04-26 18:41:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536084228] [2025-04-26 18:41:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:43,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:43,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:43,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,012 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:44,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:44,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:44,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:44,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:44,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:44,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:44,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:44,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:44,018 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:44,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,205 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:44,207 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:44,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,210 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:41:44,212 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:41:44,213 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:41:44,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,233 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:44,240 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:41:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,242 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:41:44,243 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:41:44,244 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:41:44,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,264 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:44,270 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:41:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,272 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:41:44,274 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:41:44,275 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:41:44,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:44,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,302 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:41:44,303 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:41:44,304 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:41:44,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,327 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:44,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,335 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:41:44,337 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:41:44,338 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:41:44,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:44,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:44,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:44,351 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:44,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,358 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:41:44,361 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:41:44,362 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:41:44,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:44,394 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:44,394 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,416 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:41:44,418 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:41:44,419 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:44,436 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:41:44,437 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:44,437 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:44,437 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2025-04-26 18:41:44,443 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:41:44,445 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:44,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:44,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:44,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:44,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:44,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:44,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:44,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:44,501 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:41:44,517 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:44,519 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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:41:44,633 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 612 states, 610 states have (on average 1.8) internal successors, (in total 1098), 611 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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 1506 states and 3044 transitions. Complement of second has 7 states. [2025-04-26 18:41:44,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) 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:41:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 18:41:44,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:41:44,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:41:44,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:41:44,641 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 3044 transitions. [2025-04-26 18:41:44,654 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 18:41:44,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 827 states and 1661 transitions. [2025-04-26 18:41:44,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2025-04-26 18:41:44,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 508 [2025-04-26 18:41:44,673 INFO L74 IsDeterministic]: Start isDeterministic. Operand 827 states and 1661 transitions. [2025-04-26 18:41:44,673 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:44,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 827 states and 1661 transitions. [2025-04-26 18:41:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 1661 transitions. [2025-04-26 18:41:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 686. [2025-04-26 18:41:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 686 states have (on average 2.0335276967930027) internal successors, (in total 1395), 685 states have internal predecessors, (1395), 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:41:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1395 transitions. [2025-04-26 18:41:44,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 686 states and 1395 transitions. [2025-04-26 18:41:44,721 INFO L438 stractBuchiCegarLoop]: Abstraction has 686 states and 1395 transitions. [2025-04-26 18:41:44,721 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:44,721 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1395 transitions. [2025-04-26 18:41:44,723 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 18:41:44,723 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:44,724 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:44,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:44,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:44,724 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:44,724 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 18:41:44,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash 179781734, now seen corresponding path program 1 times [2025-04-26 18:41:44,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17289958] [2025-04-26 18:41:44,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:44,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:44,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:44,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 1 times [2025-04-26 18:41:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072997166] [2025-04-26 18:41:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:44,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:44,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:44,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:44,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1659053577, now seen corresponding path program 1 times [2025-04-26 18:41:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434059408] [2025-04-26 18:41:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:44,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:44,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,779 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:41:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:44,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434059408] [2025-04-26 18:41:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434059408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612409232] [2025-04-26 18:41:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:44,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:44,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:44,835 INFO L87 Difference]: Start difference. First operand 686 states and 1395 transitions. cyclomatic complexity: 777 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:44,871 INFO L93 Difference]: Finished difference Result 961 states and 1852 transitions. [2025-04-26 18:41:44,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 961 states and 1852 transitions. [2025-04-26 18:41:44,877 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 330 [2025-04-26 18:41:44,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 961 states to 905 states and 1777 transitions. [2025-04-26 18:41:44,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 497 [2025-04-26 18:41:44,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2025-04-26 18:41:44,884 INFO L74 IsDeterministic]: Start isDeterministic. Operand 905 states and 1777 transitions. [2025-04-26 18:41:44,884 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:44,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 905 states and 1777 transitions. [2025-04-26 18:41:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states and 1777 transitions. [2025-04-26 18:41:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 759. [2025-04-26 18:41:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 759 states have (on average 2.0790513833992095) internal successors, (in total 1578), 758 states have internal predecessors, (1578), 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:41:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1578 transitions. [2025-04-26 18:41:44,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 759 states and 1578 transitions. [2025-04-26 18:41:44,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:44,910 INFO L438 stractBuchiCegarLoop]: Abstraction has 759 states and 1578 transitions. [2025-04-26 18:41:44,910 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:44,910 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1578 transitions. [2025-04-26 18:41:44,913 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 276 [2025-04-26 18:41:44,913 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:44,913 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:44,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:44,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:44,914 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:44,914 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 18:41:44,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1278266577, now seen corresponding path program 1 times [2025-04-26 18:41:44,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783057981] [2025-04-26 18:41:44,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:44,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:44,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 1 times [2025-04-26 18:41:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296544691] [2025-04-26 18:41:44,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:44,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:44,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:44,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:44,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1659653401, now seen corresponding path program 1 times [2025-04-26 18:41:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424724013] [2025-04-26 18:41:44,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:44,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:44,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,974 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:41:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:44,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424724013] [2025-04-26 18:41:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424724013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:44,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963540458] [2025-04-26 18:41:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:45,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:45,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:45,005 INFO L87 Difference]: Start difference. First operand 759 states and 1578 transitions. cyclomatic complexity: 897 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:45,033 INFO L93 Difference]: Finished difference Result 1133 states and 2270 transitions. [2025-04-26 18:41:45,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1133 states and 2270 transitions. [2025-04-26 18:41:45,058 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 18:41:45,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1133 states to 1002 states and 2030 transitions. [2025-04-26 18:41:45,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2025-04-26 18:41:45,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2025-04-26 18:41:45,066 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1002 states and 2030 transitions. [2025-04-26 18:41:45,068 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:45,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1002 states and 2030 transitions. [2025-04-26 18:41:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states and 2030 transitions. [2025-04-26 18:41:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 825. [2025-04-26 18:41:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 825 states have (on average 2.124848484848485) internal successors, (in total 1753), 824 states have internal predecessors, (1753), 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:41:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1753 transitions. [2025-04-26 18:41:45,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 825 states and 1753 transitions. [2025-04-26 18:41:45,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:45,089 INFO L438 stractBuchiCegarLoop]: Abstraction has 825 states and 1753 transitions. [2025-04-26 18:41:45,089 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:45,089 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 825 states and 1753 transitions. [2025-04-26 18:41:45,092 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 258 [2025-04-26 18:41:45,092 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:45,092 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:45,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:45,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:45,093 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:45,093 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:45,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash -109161053, now seen corresponding path program 1 times [2025-04-26 18:41:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639725854] [2025-04-26 18:41:45,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:45,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:45,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:45,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:45,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 2 times [2025-04-26 18:41:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69816121] [2025-04-26 18:41:45,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:45,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:45,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:45,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:45,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:45,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1049315066, now seen corresponding path program 1 times [2025-04-26 18:41:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037585987] [2025-04-26 18:41:45,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:45,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:45,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:45,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037585987] [2025-04-26 18:41:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037585987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:45,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269586481] [2025-04-26 18:41:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:45,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-26 18:41:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:45,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:45,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:45,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:45,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 18:41:45,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 18:41:45,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269586481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:45,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-04-26 18:41:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844130272] [2025-04-26 18:41:45,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:45,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:45,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:45,333 INFO L87 Difference]: Start difference. First operand 825 states and 1753 transitions. cyclomatic complexity: 1018 Second operand has 5 states, 4 states have (on average 5.75) internal successors, (in total 23), 5 states have internal predecessors, (23), 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:41:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:45,379 INFO L93 Difference]: Finished difference Result 2007 states and 4047 transitions. [2025-04-26 18:41:45,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2007 states and 4047 transitions. [2025-04-26 18:41:45,388 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 402 [2025-04-26 18:41:45,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2007 states to 1827 states and 3728 transitions. [2025-04-26 18:41:45,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 847 [2025-04-26 18:41:45,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 847 [2025-04-26 18:41:45,398 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1827 states and 3728 transitions. [2025-04-26 18:41:45,398 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:45,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1827 states and 3728 transitions. [2025-04-26 18:41:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states and 3728 transitions. [2025-04-26 18:41:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1440. [2025-04-26 18:41:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1440 states have (on average 2.182638888888889) internal successors, (in total 3143), 1439 states have internal predecessors, (3143), 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:41:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3143 transitions. [2025-04-26 18:41:45,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1440 states and 3143 transitions. [2025-04-26 18:41:45,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:45,421 INFO L438 stractBuchiCegarLoop]: Abstraction has 1440 states and 3143 transitions. [2025-04-26 18:41:45,421 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:45,421 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1440 states and 3143 transitions. [2025-04-26 18:41:45,426 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 18:41:45,426 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:45,426 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:45,426 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:41:45,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:45,427 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 18:41:45,427 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 18:41:45,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -72131967, now seen corresponding path program 1 times [2025-04-26 18:41:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382056413] [2025-04-26 18:41:45,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:45,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:45,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:45,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 2 times [2025-04-26 18:41:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608408006] [2025-04-26 18:41:45,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:45,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:45,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:45,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1399676567, now seen corresponding path program 1 times [2025-04-26 18:41:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611025605] [2025-04-26 18:41:45,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:45,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:45,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:45,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,686 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:45,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:45,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:45,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:45,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:45,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:45,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:45,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:45,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:45,687 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:45,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,925 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:45,925 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:45,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,927 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:41:45,928 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:41:45,929 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:41:45,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,944 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,950 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:41:45,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,952 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:41:45,953 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:41:45,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:41:45,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:45,978 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:45,978 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,981 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:41:45,982 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:41:45,983 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:45,999 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:41:45,999 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:45,999 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:45,999 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2025-04-26 18:41:46,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:46,008 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:46,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:46,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:46,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:46,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:46,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,060 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:41:46,060 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:46,061 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1440 states and 3143 transitions. cyclomatic complexity: 1810 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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:41:46,113 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1440 states and 3143 transitions. cyclomatic complexity: 1810. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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 4412 states and 9585 transitions. Complement of second has 5 states. [2025-04-26 18:41:46,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 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:41:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-26 18:41:46,115 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:41:46,115 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,115 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 19 letters. Loop has 3 letters. [2025-04-26 18:41:46,115 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,115 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 18:41:46,115 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4412 states and 9585 transitions. [2025-04-26 18:41:46,142 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 18:41:46,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4412 states to 3196 states and 6759 transitions. [2025-04-26 18:41:46,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1262 [2025-04-26 18:41:46,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2025-04-26 18:41:46,163 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3196 states and 6759 transitions. [2025-04-26 18:41:46,163 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:46,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3196 states and 6759 transitions. [2025-04-26 18:41:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states and 6759 transitions. [2025-04-26 18:41:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2330. [2025-04-26 18:41:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2330 states have (on average 2.296137339055794) internal successors, (in total 5350), 2329 states have internal predecessors, (5350), 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:41:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 5350 transitions. [2025-04-26 18:41:46,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2330 states and 5350 transitions. [2025-04-26 18:41:46,226 INFO L438 stractBuchiCegarLoop]: Abstraction has 2330 states and 5350 transitions. [2025-04-26 18:41:46,226 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:46,226 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2330 states and 5350 transitions. [2025-04-26 18:41:46,235 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 294 [2025-04-26 18:41:46,235 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,235 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:46,236 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[104] L55-->thread3FINAL: Formula: (not v_v_assert_8) InVars {v_assert=v_v_assert_8} OutVars{v_assert=v_v_assert_8} AuxVars[] AssignedVars[]" "[106] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:41:46,236 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 18:41:46,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1449652339, now seen corresponding path program 1 times [2025-04-26 18:41:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397641407] [2025-04-26 18:41:46,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:46,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:46,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-26 18:41:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:46,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397641407] [2025-04-26 18:41:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397641407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:46,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509458873] [2025-04-26 18:41:46,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:46,254 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:46,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 3 times [2025-04-26 18:41:46,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213592937] [2025-04-26 18:41:46,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:46,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:46,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:46,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:46,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:46,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:46,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:46,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:46,295 INFO L87 Difference]: Start difference. First operand 2330 states and 5350 transitions. cyclomatic complexity: 3193 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:46,326 INFO L93 Difference]: Finished difference Result 2179 states and 4702 transitions. [2025-04-26 18:41:46,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2179 states and 4702 transitions. [2025-04-26 18:41:46,337 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 262 [2025-04-26 18:41:46,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2179 states to 2005 states and 4320 transitions. [2025-04-26 18:41:46,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 819 [2025-04-26 18:41:46,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 819 [2025-04-26 18:41:46,348 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2005 states and 4320 transitions. [2025-04-26 18:41:46,348 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:46,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2005 states and 4320 transitions. [2025-04-26 18:41:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states and 4320 transitions. [2025-04-26 18:41:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1806. [2025-04-26 18:41:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1806 states have (on average 2.2397563676633445) internal successors, (in total 4045), 1805 states have internal predecessors, (4045), 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:41:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 4045 transitions. [2025-04-26 18:41:46,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1806 states and 4045 transitions. [2025-04-26 18:41:46,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:46,378 INFO L438 stractBuchiCegarLoop]: Abstraction has 1806 states and 4045 transitions. [2025-04-26 18:41:46,378 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:46,378 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1806 states and 4045 transitions. [2025-04-26 18:41:46,384 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 262 [2025-04-26 18:41:46,384 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,384 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:46,385 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[122] L82-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[109] $Ultimate##0-->thread4FINAL: Formula: (let ((.cse0 (* 2 v_W_3))) (or (and (not v_v_assert_9) (< .cse0 v_d2_4)) (and (<= v_d2_4 .cse0) v_v_assert_9))) InVars {d2=v_d2_4, W=v_W_3} OutVars{d2=v_d2_4, v_assert=v_v_assert_9, W=v_W_3} AuxVars[] AssignedVars[v_assert]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[110] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[93] L26-->thread1FINAL: Formula: (or (not v_v_assert_2) (<= v_w_4 0)) InVars {v_assert=v_v_assert_2, w=v_w_4} OutVars{v_assert=v_v_assert_2, w=v_w_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:46,385 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 18:41:46,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -815817651, now seen corresponding path program 1 times [2025-04-26 18:41:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634519662] [2025-04-26 18:41:46,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:46,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:46,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 4 times [2025-04-26 18:41:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773689088] [2025-04-26 18:41:46,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,397 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 18:41:46,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:46,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:46,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:46,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1566755216, now seen corresponding path program 1 times [2025-04-26 18:41:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998337490] [2025-04-26 18:41:46,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:46,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:46,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:46,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:46,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,663 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:46,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:46,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:46,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:46,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:46,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:46,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:46,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:41:46,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:46,664 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:46,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,899 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:46,899 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,903 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:41:46,904 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:41:46,905 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:41:46,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:46,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,931 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:41:46,932 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:41:46,933 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:41:46,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,948 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:46,954 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:41:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,956 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:41:46,957 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:41:46,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:46,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,973 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:46,979 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:41:46,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,981 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:41:46,982 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:41:46,984 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:41:46,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,999 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,005 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:41:47,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,007 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:41:47,009 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:41:47,010 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:41:47,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,023 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,032 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:41:47,033 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:41:47,034 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:41:47,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,048 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,054 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:41:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,056 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:41:47,058 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:41:47,059 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:41:47,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,073 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,079 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:41:47,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,080 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:41:47,082 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:41:47,082 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:41:47,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,103 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:41:47,104 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:41:47,105 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:41:47,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,123 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:41:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,125 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:41:47,126 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:41:47,127 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:41:47,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,146 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:41:47,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,148 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:41:47,149 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:41:47,150 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:41:47,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,168 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,173 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:41:47,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,175 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:41:47,177 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:41:47,178 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:41:47,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,195 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,203 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:41:47,206 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:41:47,207 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:41:47,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,221 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,230 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:41:47,230 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:41:47,232 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:41:47,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,245 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,251 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:41:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,253 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:41:47,253 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:41:47,254 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:41:47,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,268 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,274 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:41:47,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,277 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:41:47,277 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:41:47,279 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:41:47,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,295 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:41:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,302 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:41:47,304 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:41:47,305 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:41:47,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,324 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,332 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:41:47,333 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:41:47,335 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:41:47,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:47,360 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:47,360 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,362 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:41:47,364 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:41:47,365 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:47,381 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:41:47,381 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:47,381 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:47,381 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 18:41:47,386 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:41:47,390 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:47,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:47,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:47,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:47,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:47,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:47,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:47,446 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:41:47,446 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:47,447 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1806 states and 4045 transitions. cyclomatic complexity: 2388 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:47,481 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1806 states and 4045 transitions. cyclomatic complexity: 2388. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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 2462 states and 5324 transitions. Complement of second has 4 states. [2025-04-26 18:41:47,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 18:41:47,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:47,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:47,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 18:41:47,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2462 states and 5324 transitions. [2025-04-26 18:41:47,495 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 112 [2025-04-26 18:41:47,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2462 states to 1284 states and 2861 transitions. [2025-04-26 18:41:47,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2025-04-26 18:41:47,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2025-04-26 18:41:47,503 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1284 states and 2861 transitions. [2025-04-26 18:41:47,503 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:47,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1284 states and 2861 transitions. [2025-04-26 18:41:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states and 2861 transitions. [2025-04-26 18:41:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1107. [2025-04-26 18:41:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1107 states have (on average 2.3450767841011744) internal successors, (in total 2596), 1106 states have internal predecessors, (2596), 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:41:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2596 transitions. [2025-04-26 18:41:47,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1107 states and 2596 transitions. [2025-04-26 18:41:47,518 INFO L438 stractBuchiCegarLoop]: Abstraction has 1107 states and 2596 transitions. [2025-04-26 18:41:47,518 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:41:47,518 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1107 states and 2596 transitions. [2025-04-26 18:41:47,521 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 100 [2025-04-26 18:41:47,521 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:47,522 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:47,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:47,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:47,522 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:47,522 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:47,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1887772085, now seen corresponding path program 2 times [2025-04-26 18:41:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698023879] [2025-04-26 18:41:47,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-26 18:41:47,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:47,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:47,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:47,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:47,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 5 times [2025-04-26 18:41:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119422133] [2025-04-26 18:41:47,533 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,536 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:47,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:47,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1215647314, now seen corresponding path program 3 times [2025-04-26 18:41:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582498514] [2025-04-26 18:41:47,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-26 18:41:47,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:47,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 18:41:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:41:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:47,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582498514] [2025-04-26 18:41:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582498514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:47,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472828479] [2025-04-26 18:41:47,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,638 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:47,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-26 18:41:47,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-26 18:41:47,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:47,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 18:41:47,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:41:47,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 18:41:47,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 18:41:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472828479] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:47,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-26 18:41:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266955522] [2025-04-26 18:41:47,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:47,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:47,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:47,766 INFO L87 Difference]: Start difference. First operand 1107 states and 2596 transitions. cyclomatic complexity: 1582 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (in total 30), 6 states have internal predecessors, (30), 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:41:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:47,814 INFO L93 Difference]: Finished difference Result 2333 states and 5146 transitions. [2025-04-26 18:41:47,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2333 states and 5146 transitions. [2025-04-26 18:41:47,826 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 280 [2025-04-26 18:41:47,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2333 states to 2278 states and 5056 transitions. [2025-04-26 18:41:47,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 880 [2025-04-26 18:41:47,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 917 [2025-04-26 18:41:47,839 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2278 states and 5056 transitions. [2025-04-26 18:41:47,839 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:47,839 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2278 states and 5056 transitions. [2025-04-26 18:41:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states and 5056 transitions. [2025-04-26 18:41:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1636. [2025-04-26 18:41:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1636 states have (on average 2.363080684596577) internal successors, (in total 3866), 1635 states have internal predecessors, (3866), 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:41:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3866 transitions. [2025-04-26 18:41:47,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1636 states and 3866 transitions. [2025-04-26 18:41:47,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:47,867 INFO L438 stractBuchiCegarLoop]: Abstraction has 1636 states and 3866 transitions. [2025-04-26 18:41:47,867 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:41:47,867 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1636 states and 3866 transitions. [2025-04-26 18:41:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 112 [2025-04-26 18:41:47,872 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:47,873 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:47,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:47,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:47,873 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" [2025-04-26 18:41:47,873 INFO L754 eck$LassoCheckResult]: Loop: "[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[]" "[107] L56-->L56-1: Formula: (and (= (+ v_front2_11 1) v_front2_10) (< v_front2_11 v_back2_10) (= v_temp2_5 (select v_queue2_7 v_front2_11))) InVars {front2=v_front2_11, queue2=v_queue2_7, back2=v_back2_10} OutVars{front2=v_front2_10, queue2=v_queue2_7, back2=v_back2_10, temp2=v_temp2_5} AuxVars[] AssignedVars[temp2, front2]" "[108] L56-1-->L55: Formula: (= v_d2_2 (+ v_temp2_2 v_d2_3)) InVars {d2=v_d2_3, temp2=v_temp2_2} OutVars{d2=v_d2_2, temp2=v_temp2_2} AuxVars[] AssignedVars[d2]" [2025-04-26 18:41:47,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1575885015, now seen corresponding path program 2 times [2025-04-26 18:41:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289031300] [2025-04-26 18:41:47,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-26 18:41:47,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:47,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:47,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:47,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 3 times [2025-04-26 18:41:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890479370] [2025-04-26 18:41:47,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:47,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:47,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:47,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:47,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:47,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1097135041, now seen corresponding path program 2 times [2025-04-26 18:41:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153393943] [2025-04-26 18:41:47,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 18:41:47,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:47,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:41:47,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:41:47,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:48,149 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:48,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:48,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:48,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:48,150 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:48,150 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:48,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:48,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:41:48,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:48,150 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:48,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,437 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:48,437 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:48,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,440 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:41:48,441 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:41:48,441 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:41:48,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:48,463 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:48,464 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,466 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:41:48,466 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:41:48,467 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:48,483 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:41:48,484 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:48,484 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:48,484 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2025-04-26 18:41:48,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:41:48,496 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-04-26 18:41:48,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:48,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:48,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:48,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,551 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:41:48,551 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:48,551 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,584 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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 2837 states and 6550 transitions. Complement of second has 5 states. [2025-04-26 18:41:48,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 18:41:48,585 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 18:41:48,585 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,585 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:48,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:48,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:48,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:48,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,639 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:41:48,640 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:48,640 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,693 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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 4277 states and 10553 transitions. Complement of second has 7 states. [2025-04-26 18:41:48,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 18:41:48,694 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 18:41:48,694 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,694 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:48,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:48,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:48,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,752 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:41:48,752 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:48,753 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,786 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1636 states and 3866 transitions. cyclomatic complexity: 2341. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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 3365 states and 8539 transitions. Complement of second has 4 states. [2025-04-26 18:41:48,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (in total 20), 4 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:41:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 18:41:48,787 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 18:41:48,787 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,787 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:41:48,787 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,787 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 23 letters. Loop has 6 letters. [2025-04-26 18:41:48,787 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3365 states and 8539 transitions. [2025-04-26 18:41:48,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2025-04-26 18:41:48,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3365 states to 1125 states and 2609 transitions. [2025-04-26 18:41:48,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 18:41:48,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2025-04-26 18:41:48,808 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1125 states and 2609 transitions. [2025-04-26 18:41:48,808 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:48,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2609 transitions. [2025-04-26 18:41:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states and 2609 transitions. [2025-04-26 18:41:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 456. [2025-04-26 18:41:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 456 states have (on average 2.25) internal successors, (in total 1026), 455 states have internal predecessors, (1026), 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:41:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1026 transitions. [2025-04-26 18:41:48,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 456 states and 1026 transitions. [2025-04-26 18:41:48,816 INFO L438 stractBuchiCegarLoop]: Abstraction has 456 states and 1026 transitions. [2025-04-26 18:41:48,816 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:41:48,816 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 1026 transitions. [2025-04-26 18:41:48,817 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 18:41:48,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:48,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:48,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:48,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:48,817 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:48,817 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:48,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1869105174, now seen corresponding path program 1 times [2025-04-26 18:41:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:48,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469731764] [2025-04-26 18:41:48,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:48,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:48,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:48,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:48,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:48,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:48,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 4033726, now seen corresponding path program 6 times [2025-04-26 18:41:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:48,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870669033] [2025-04-26 18:41:48,824 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:48,826 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:48,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:48,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:41:48,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:48,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:48,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:48,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1930090457, now seen corresponding path program 4 times [2025-04-26 18:41:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:48,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994224060] [2025-04-26 18:41:48,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:48,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-26 18:41:48,834 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:48,834 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:48,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:48,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:48,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:48,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:48,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:48,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:48,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:48,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:48,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:48,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:48,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:41:48,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:48,989 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:48,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,155 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:49,155 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,157 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:41:49,158 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:41:49,159 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:41:49,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:41:49,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,179 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:41:49,179 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:41:49,180 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:41:49,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,194 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,202 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:41:49,203 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:41:49,204 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:41:49,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:49,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,225 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:41:49,226 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:41:49,228 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:41:49,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,241 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:49,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,249 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:41:49,251 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:41:49,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:49,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,266 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 18:41:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,274 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:41:49,274 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:41:49,275 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:41:49,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,288 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,294 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:41:49,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,296 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:41:49,297 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:41:49,298 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:41:49,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,313 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,318 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:41:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,321 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:41:49,322 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:41:49,323 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:41:49,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:49,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,344 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:41:49,345 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:41:49,347 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:41:49,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:49,369 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:49,369 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,371 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:41:49,372 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:41:49,373 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:49,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:49,390 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:49,390 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:49,390 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 18:41:49,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 18:41:49,402 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:49,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:49,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:49,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:49,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:49,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:49,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:49,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:49,455 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:41:49,456 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:49,456 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 456 states and 1026 transitions. cyclomatic complexity: 582 Second operand has 3 states, 3 states have (on average 5.333333333333333) 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:41:49,474 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 456 states and 1026 transitions. cyclomatic complexity: 582. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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 1064 states and 2388 transitions. Complement of second has 5 states. [2025-04-26 18:41:49,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) 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:41:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-26 18:41:49,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 18:41:49,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:49,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 22 letters. Loop has 4 letters. [2025-04-26 18:41:49,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:49,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 18:41:49,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:49,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1064 states and 2388 transitions. [2025-04-26 18:41:49,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 18:41:49,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1064 states to 835 states and 1888 transitions. [2025-04-26 18:41:49,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 18:41:49,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 18:41:49,483 INFO L74 IsDeterministic]: Start isDeterministic. Operand 835 states and 1888 transitions. [2025-04-26 18:41:49,484 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:49,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 835 states and 1888 transitions. [2025-04-26 18:41:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states and 1888 transitions. [2025-04-26 18:41:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 689. [2025-04-26 18:41:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 689 states have (on average 2.3730043541364294) internal successors, (in total 1635), 688 states have internal predecessors, (1635), 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:41:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1635 transitions. [2025-04-26 18:41:49,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 689 states and 1635 transitions. [2025-04-26 18:41:49,493 INFO L438 stractBuchiCegarLoop]: Abstraction has 689 states and 1635 transitions. [2025-04-26 18:41:49,493 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:41:49,493 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 689 states and 1635 transitions. [2025-04-26 18:41:49,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 18:41:49,494 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,494 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:49,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:49,495 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:49,495 INFO L754 eck$LassoCheckResult]: Loop: "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" [2025-04-26 18:41:49,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1169489021, now seen corresponding path program 2 times [2025-04-26 18:41:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555666836] [2025-04-26 18:41:49,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 18:41:49,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:49,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:49,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:49,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:49,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 4064356, now seen corresponding path program 7 times [2025-04-26 18:41:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112560426] [2025-04-26 18:41:49,511 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:49,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:49,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -831031578, now seen corresponding path program 5 times [2025-04-26 18:41:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172970720] [2025-04-26 18:41:49,517 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 5 equivalence classes. [2025-04-26 18:41:49,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:49,527 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-26 18:41:49,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:49,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:41:49,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,693 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:49,693 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:49,693 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:49,693 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:49,693 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:49,693 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,693 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:49,693 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:49,693 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 18:41:49,693 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:49,693 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:49,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:49,867 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:49,867 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,869 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:41:49,871 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:41:49,872 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:41:49,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 18:41:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,892 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:41:49,892 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:41:49,893 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:41:49,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,912 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:41:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,914 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:41:49,915 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:41:49,916 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:41:49,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,934 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:41:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,936 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:41:49,937 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:41:49,938 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:41:49,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:41:49,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,958 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:41:49,959 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:41:49,960 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:41:49,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,973 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:49,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 18:41:49,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:49,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,980 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:41:49,981 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:41:49,982 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:41:49,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:49,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:49,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:49,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:49,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:49,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:49,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:41:50,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,004 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:41:50,005 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:41:50,006 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:41:50,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,026 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,035 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:41:50,037 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:41:50,038 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:41:50,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:50,069 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:50,069 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,071 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:41:50,073 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:41:50,074 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:50,091 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:41:50,091 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:50,091 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:50,091 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 18:41:50,097 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:41:50,100 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:41:50,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:41:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:41:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,143 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:41:50,144 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:50,144 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 689 states and 1635 transitions. cyclomatic complexity: 978 Second operand has 3 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:41:50,162 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 689 states and 1635 transitions. cyclomatic complexity: 978. Second operand has 3 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) Result 1438 states and 3347 transitions. Complement of second has 5 states. [2025-04-26 18:41:50,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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:41:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-26 18:41:50,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 18:41:50,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:50,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 18:41:50,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1438 states and 3347 transitions. [2025-04-26 18:41:50,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 18:41:50,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1438 states to 1058 states and 2444 transitions. [2025-04-26 18:41:50,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 18:41:50,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 18:41:50,211 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1058 states and 2444 transitions. [2025-04-26 18:41:50,211 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:50,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1058 states and 2444 transitions. [2025-04-26 18:41:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states and 2444 transitions. [2025-04-26 18:41:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 745. [2025-04-26 18:41:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 745 states have (on average 2.3248322147651006) internal successors, (in total 1732), 744 states have internal predecessors, (1732), 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:41:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1732 transitions. [2025-04-26 18:41:50,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 1732 transitions. [2025-04-26 18:41:50,220 INFO L438 stractBuchiCegarLoop]: Abstraction has 745 states and 1732 transitions. [2025-04-26 18:41:50,220 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:41:50,220 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 1732 transitions. [2025-04-26 18:41:50,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-04-26 18:41:50,221 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:50,221 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:50,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:50,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:50,222 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L75: Formula: (<= 0 v_W_1) InVars {W=v_W_1} OutVars{W=v_W_1} AuxVars[] AssignedVars[]" "[82] L75-->L76: Formula: (= v_W_2 v_w_5) InVars {w=v_w_5, W=v_W_2} OutVars{w=v_w_5, W=v_W_2} AuxVars[] AssignedVars[]" "[91] L76-->L77: Formula: (and (= v_d2_1 v_d1_3) (= v_d1_3 0)) InVars {d1=v_d1_3, d2=v_d2_1} OutVars{d1=v_d1_3, d2=v_d2_1} AuxVars[] AssignedVars[]" "[66] L77-->L78: Formula: v_v_assert_6 InVars {v_assert=v_v_assert_6} OutVars{v_assert=v_v_assert_6} AuxVars[] AssignedVars[]" "[76] L78-->L79: Formula: (= v_back1_5 v_front1_5) InVars {front1=v_front1_5, back1=v_back1_5} OutVars{front1=v_front1_5, back1=v_back1_5} AuxVars[] AssignedVars[]" "[75] L79-->L80: Formula: (= v_back2_4 v_front2_1) InVars {front2=v_front2_1, back2=v_back2_4} OutVars{front2=v_front2_1, back2=v_back2_4} AuxVars[] AssignedVars[]" "[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[94] L26-->L27: Formula: (and (< 0 v_w_1) v_v_assert_1) InVars {v_assert=v_v_assert_1, w=v_w_1} OutVars{v_assert=v_v_assert_1, w=v_w_1} AuxVars[] AssignedVars[]" "[96] L27-->L27-1: Formula: (and (= (select v_queue1_3 v_back1_7) 1) (= (+ v_back1_7 1) v_back1_6)) InVars {queue1=v_queue1_3, back1=v_back1_7} OutVars{queue1=v_queue1_3, back1=v_back1_6} AuxVars[] AssignedVars[back1]" "[97] L27-1-->L26: Formula: (= (+ v_w_2 1) v_w_3) InVars {w=v_w_3} OutVars{w=v_w_2} AuxVars[] AssignedVars[w]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:50,222 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L39-1: Formula: (and (= v_temp1_8 (select v_queue1_7 v_front1_11)) (= (+ v_front1_11 1) v_front1_10) (< v_front1_11 v_back1_10)) InVars {queue1=v_queue1_7, front1=v_front1_11, back1=v_back1_10} OutVars{temp1=v_temp1_8, queue1=v_queue1_7, front1=v_front1_10, back1=v_back1_10} AuxVars[] AssignedVars[temp1, front1]" "[102] L39-1-->L44: Formula: (and (= v_back2_6 (+ v_back2_7 1)) (= (select v_queue2_3 v_back2_7) (+ v_temp1_4 1))) InVars {temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_7} OutVars{temp1=v_temp1_4, queue2=v_queue2_3, back2=v_back2_6} AuxVars[] AssignedVars[back2]" "[103] L44-->L38: Formula: (= v_d1_1 (+ v_temp1_1 v_d1_2)) InVars {temp1=v_temp1_1, d1=v_d1_2} OutVars{temp1=v_temp1_1, d1=v_d1_1} AuxVars[] AssignedVars[d1]" "[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:50,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1028585560, now seen corresponding path program 6 times [2025-04-26 18:41:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931975083] [2025-04-26 18:41:50,223 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-26 18:41:50,228 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:50,229 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 18:41:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:50,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 4033726, now seen corresponding path program 8 times [2025-04-26 18:41:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946584383] [2025-04-26 18:41:50,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:50,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:50,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1849977061, now seen corresponding path program 7 times [2025-04-26 18:41:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227777715] [2025-04-26 18:41:50,241 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:41:50,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:41:50,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:41:50,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:41:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,462 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:50,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:50,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:50,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:50,462 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:50,462 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,462 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:50,462 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:50,462 INFO L132 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 18:41:50,462 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:50,462 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:50,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,658 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:50,658 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,660 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:41:50,661 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:41:50,662 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:41:50,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 18:41:50,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,682 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:41:50,683 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:41:50,684 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:41:50,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,696 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,701 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:41:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,703 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:41:50,703 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:41:50,704 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:41:50,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,718 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 18:41:50,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,724 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:41:50,725 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:41:50,726 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:41:50,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,738 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 18:41:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,745 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:41:50,746 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:41:50,746 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:41:50,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,759 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,764 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:41:50,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,766 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:41:50,767 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:41:50,768 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:41:50,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:50,792 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:50,792 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,795 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:41:50,796 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:41:50,797 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:50,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:50,813 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:50,813 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:50,813 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2025-04-26 18:41:50,819 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:41:50,825 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 18:41:50,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:50,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:50,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,889 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:41:50,889 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:50,890 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:50,910 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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 1372 states and 3097 transitions. Complement of second has 5 states. [2025-04-26 18:41:50,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-26 18:41:50,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 18:41:50,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,910 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:50,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:50,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:50,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:50,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,968 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:41:50,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:50,969 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:50,995 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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 2117 states and 5063 transitions. Complement of second has 7 states. [2025-04-26 18:41:50,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 18:41:50,996 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 18:41:50,996 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,996 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:51,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:51,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:51,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:51,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:51,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,073 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:41:51,073 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:51,073 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024 Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:51,092 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 745 states and 1732 transitions. cyclomatic complexity: 1024. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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 1868 states and 4613 transitions. Complement of second has 6 states. [2025-04-26 18:41:51,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) 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:41:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 18:41:51,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 18:41:51,093 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 29 letters. Loop has 4 letters. [2025-04-26 18:41:51,093 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,093 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 25 letters. Loop has 8 letters. [2025-04-26 18:41:51,093 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1868 states and 4613 transitions. [2025-04-26 18:41:51,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:51,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1868 states to 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:51,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:51,101 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:51,101 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:41:51,101 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:51,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:51,101 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:51,111 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:41:51,112 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:51 BoogieIcfgContainer [2025-04-26 18:41:51,112 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:51,113 INFO L158 Benchmark]: Toolchain (without parser) took 8264.31ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 85.7MB in the beginning and 145.0MB in the end (delta: -59.3MB). Peak memory consumption was 3.7MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,113 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.82ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,113 INFO L158 Benchmark]: Boogie Preprocessor took 26.24ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 993.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,114 INFO L158 Benchmark]: RCFGBuilder took 230.03ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.1MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,115 INFO L158 Benchmark]: BuchiAutomizer took 7966.84ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 72.0MB in the beginning and 145.0MB in the end (delta: -73.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,115 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.82ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.24ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 993.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 230.03ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.1MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 7966.84ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 72.0MB in the beginning and 145.0MB in the end (delta: -73.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 5.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 3863 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 409 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 352 mSDtfsCounter, 409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp66 ukn93 mio100 lsp58 div100 bol100 ite100 ukn100 eq212 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 395, Number of transitions in reduction automaton: 1098, Number of states in reduction automaton: 612, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function w and consists of 5 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One nondeterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:51,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...