/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/queue-add-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:42,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:42,809 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,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:42,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:42,813 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,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:42,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:42,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:42,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:42,834 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:42,834 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:42,835 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:42,835 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:42,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:42,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:42,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:42,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:42,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:42,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:42,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:42,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:42,837 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:42,837 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:42,837 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:43,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:43,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:43,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:43,051 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:43,052 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:43,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl [2025-04-26 18:41:43,053 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2025-04-26 18:41:43,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:43,073 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:43,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:43,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:43,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:43,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,105 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:43,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:43,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:43,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:43,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:43,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:43,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:43,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:43,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:43,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/1) ... [2025-04-26 18:41:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:43,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:43,159 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:43,165 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:43,183 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:43,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:43,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:43,184 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:43,185 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,227 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:43,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:43,338 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:43,338 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:43,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:43,362 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:43,362 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:43 BoogieIcfgContainer [2025-04-26 18:41:43,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:43,363 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:43,363 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:43,367 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:43,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:43,368 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:43" (1/2) ... [2025-04-26 18:41:43,369 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17e4c008 and model type queue-add-3.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,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:43,369 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:43" (2/2) ... [2025-04-26 18:41:43,370 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2025-04-26 18:41:43,420 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:43,452 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:43,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:43,454 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,456 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,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-04-26 18:41:43,529 INFO L116 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-04-26 18:41:43,531 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:43,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-26 18:41:43,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-04-26 18:41:43,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 35 transitions, 88 flow [2025-04-26 18:41:43,536 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 35 transitions, 88 flow [2025-04-26 18:41:43,537 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 35 transitions, 88 flow [2025-04-26 18:41:43,584 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 661 states, 659 states have (on average 2.9650986342943852) internal successors, (in total 1954), 660 states have internal predecessors, (1954), 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,586 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 661 states, 659 states have (on average 2.9650986342943852) internal successors, (in total 1954), 660 states have internal predecessors, (1954), 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,588 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:43,720 WARN L140 AmpleReduction]: Number of pruned transitions: 629 [2025-04-26 18:41:43,720 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:43,720 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 92 [2025-04-26 18:41:43,721 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:41:43,721 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:338 [2025-04-26 18:41:43,721 WARN L145 AmpleReduction]: Times succ was already a loop node:28 [2025-04-26 18:41:43,721 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:128 [2025-04-26 18:41:43,721 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:43,722 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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,728 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:43,728 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:43,728 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:43,728 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:43,728 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:43,728 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:43,728 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:43,728 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:43,730 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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,781 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 338 [2025-04-26 18:41:43,781 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:43,781 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:43,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:43,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:43,786 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:43,787 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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,798 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 338 [2025-04-26 18:41:43,798 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:43,799 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:43,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:43,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:43,804 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:43,805 INFO L754 eck$LassoCheckResult]: Loop: "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:43,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 123135, now seen corresponding path program 1 times [2025-04-26 18:41:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692296004] [2025-04-26 18:41:43,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,856 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,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,860 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,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:43,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 127171, now seen corresponding path program 1 times [2025-04-26 18:41:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003229591] [2025-04-26 18:41:43,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,880 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,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:43,882 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,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:43,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -626555131, now seen corresponding path program 1 times [2025-04-26 18:41:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:43,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670898457] [2025-04-26 18:41:43,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:43,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:43,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:43,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:43,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:43,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:43,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:43,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:43,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,001 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:44,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:44,002 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:44,002 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:44,002 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:44,002 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,002 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:44,002 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:44,002 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:44,002 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:44,002 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:44,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,169 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:44,172 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:44,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,176 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,178 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,179 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,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,206 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:44,220 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:44,220 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,239 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,240 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,242 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:44,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:44,259 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:44,259 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:44,260 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:44,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:41:44,268 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:44,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:44,298 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,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:44,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:44,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:44,316 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,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:44,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:44,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:44,345 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,359 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,361 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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,449 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 458 states, 456 states have (on average 1.594298245614035) internal successors, (in total 727), 457 states have internal predecessors, (727), 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 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 1045 states and 1797 transitions. Complement of second has 7 states. [2025-04-26 18:41:44,450 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,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-26 18:41:44,457 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:41:44,458 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,458 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:41:44,458 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,458 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:41:44,458 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:44,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1045 states and 1797 transitions. [2025-04-26 18:41:44,470 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:44,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1045 states to 587 states and 969 transitions. [2025-04-26 18:41:44,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2025-04-26 18:41:44,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 359 [2025-04-26 18:41:44,485 INFO L74 IsDeterministic]: Start isDeterministic. Operand 587 states and 969 transitions. [2025-04-26 18:41:44,486 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:44,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 587 states and 969 transitions. [2025-04-26 18:41:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 969 transitions. [2025-04-26 18:41:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-04-26 18:41:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 515 states have (on average 1.6932038834951457) internal successors, (in total 872), 514 states have internal predecessors, (872), 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 872 transitions. [2025-04-26 18:41:44,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 515 states and 872 transitions. [2025-04-26 18:41:44,522 INFO L438 stractBuchiCegarLoop]: Abstraction has 515 states and 872 transitions. [2025-04-26 18:41:44,522 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:44,522 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 872 transitions. [2025-04-26 18:41:44,524 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:44,524 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:44,524 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:44,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:44,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:44,525 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:44,525 INFO L754 eck$LassoCheckResult]: Loop: "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:44,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 194504637, now seen corresponding path program 1 times [2025-04-26 18:41:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97740424] [2025-04-26 18:41:44,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:44,535 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,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:44,538 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,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash 129848075, now seen corresponding path program 1 times [2025-04-26 18:41:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98259228] [2025-04-26 18:41:44,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:44,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:44,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:44,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:44,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:44,549 INFO L85 PathProgramCache]: Analyzing trace with hash 315416783, now seen corresponding path program 1 times [2025-04-26 18:41:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:44,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451903918] [2025-04-26 18:41:44,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:44,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:44,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:44,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:44,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:44,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:44,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:44,727 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:44,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:44,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:44,728 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:44,728 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:44,728 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,728 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:44,728 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:44,728 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:44,728 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:44,728 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:44,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:44,975 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:44,975 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:44,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:44,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:44,979 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,980 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,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:44,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:44,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:44,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:44,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:44,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:44,995 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,000 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:45,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,002 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:45,003 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:45,004 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,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,020 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,026 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:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,028 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:45,029 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:45,030 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,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,044 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,051 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:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,053 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:45,054 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:45,055 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,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,066 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:45,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,092 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:45,092 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:45,124 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:45,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,132 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:45,135 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,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,152 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:45,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,159 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:45,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:45,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:45,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:45,196 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:41:45,196 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:45,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,198 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,200 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,201 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:45,217 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,218 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:45,218 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:45,218 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:45,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:45,225 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:45,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:45,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:45,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:45,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:45,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:45,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:45,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:45,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:45,310 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:45,311 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:45,311 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 872 transitions. cyclomatic complexity: 397 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 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:45,353 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 872 transitions. cyclomatic complexity: 397. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1058 states and 1696 transitions. Complement of second has 5 states. [2025-04-26 18:41:45,354 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:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 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:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 18:41:45,355 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 18:41:45,355 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:45,355 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 18:41:45,356 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:45,356 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 18:41:45,356 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:45,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1696 transitions. [2025-04-26 18:41:45,362 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 179 [2025-04-26 18:41:45,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 845 states and 1378 transitions. [2025-04-26 18:41:45,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-04-26 18:41:45,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 452 [2025-04-26 18:41:45,369 INFO L74 IsDeterministic]: Start isDeterministic. Operand 845 states and 1378 transitions. [2025-04-26 18:41:45,369 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:45,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 845 states and 1378 transitions. [2025-04-26 18:41:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states and 1378 transitions. [2025-04-26 18:41:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2025-04-26 18:41:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 700 states have (on average 1.69) internal successors, (in total 1183), 699 states have internal predecessors, (1183), 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,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1183 transitions. [2025-04-26 18:41:45,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 700 states and 1183 transitions. [2025-04-26 18:41:45,395 INFO L438 stractBuchiCegarLoop]: Abstraction has 700 states and 1183 transitions. [2025-04-26 18:41:45,395 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:45,395 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 1183 transitions. [2025-04-26 18:41:45,397 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:45,397 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:45,397 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:45,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:45,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:45,398 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[107] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:45,398 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:45,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 314476028, now seen corresponding path program 1 times [2025-04-26 18:41:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918241562] [2025-04-26 18:41:45,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:45,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:45,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:45,435 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:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:45,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918241562] [2025-04-26 18:41:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918241562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:45,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134652961] [2025-04-26 18:41:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:45,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [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 4465700, now seen corresponding path program 1 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 [779337235] [2025-04-26 18:41:45,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [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,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 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,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:45,448 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,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:45,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:45,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:45,501 INFO L87 Difference]: Start difference. First operand 700 states and 1183 transitions. cyclomatic complexity: 531 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:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:45,538 INFO L93 Difference]: Finished difference Result 772 states and 1310 transitions. [2025-04-26 18:41:45,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 1310 transitions. [2025-04-26 18:41:45,543 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:45,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 767 states and 1305 transitions. [2025-04-26 18:41:45,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2025-04-26 18:41:45,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2025-04-26 18:41:45,548 INFO L74 IsDeterministic]: Start isDeterministic. Operand 767 states and 1305 transitions. [2025-04-26 18:41:45,548 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:45,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 767 states and 1305 transitions. [2025-04-26 18:41:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 1305 transitions. [2025-04-26 18:41:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 746. [2025-04-26 18:41:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 746 states have (on average 1.695710455764075) internal successors, (in total 1265), 745 states have internal predecessors, (1265), 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,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1265 transitions. [2025-04-26 18:41:45,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 746 states and 1265 transitions. [2025-04-26 18:41:45,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:45,562 INFO L438 stractBuchiCegarLoop]: Abstraction has 746 states and 1265 transitions. [2025-04-26 18:41:45,562 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:45,562 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 746 states and 1265 transitions. [2025-04-26 18:41:45,565 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:45,565 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:45,565 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:45,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:45,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:45,567 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 18:41:45,567 INFO L754 eck$LassoCheckResult]: Loop: "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 18:41:45,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2091824574, now seen corresponding path program 1 times [2025-04-26 18:41:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451195754] [2025-04-26 18:41:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:45,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:45,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:45,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:45,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 2 times [2025-04-26 18:41:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552685369] [2025-04-26 18:41:45,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:45,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:45,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:45,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1531842394, now seen corresponding path program 1 times [2025-04-26 18:41:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:45,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778036087] [2025-04-26 18:41:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:45,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:45,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:45,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:45,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:45,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:45,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:45,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:45,773 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:45,774 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:45,774 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:45,774 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:45,774 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:45,774 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,774 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:45,774 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:45,774 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:45,774 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:45,774 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:45,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:45,960 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:45,960 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,964 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,966 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,967 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,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:45,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:45,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:45,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:45,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:45,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:45,982 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:45,988 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:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:45,990 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,992 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,993 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,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:46,020 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:46,020 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,022 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,023 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,024 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:46,040 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,040 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:46,040 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:46,040 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:46,046 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:46,049 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:41:46,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:46,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:46,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,123 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,123 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,123 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 746 states and 1265 transitions. cyclomatic complexity: 570 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:46,159 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 746 states and 1265 transitions. cyclomatic complexity: 570. 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 1315 states and 2094 transitions. Complement of second has 5 states. [2025-04-26 18:41:46,160 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,161 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:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 18:41:46,161 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 18:41:46,161 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,161 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 18:41:46,162 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,162 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 18:41:46,162 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2094 transitions. [2025-04-26 18:41:46,168 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 179 [2025-04-26 18:41:46,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1018 states and 1646 transitions. [2025-04-26 18:41:46,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-04-26 18:41:46,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2025-04-26 18:41:46,174 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1018 states and 1646 transitions. [2025-04-26 18:41:46,174 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:46,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1018 states and 1646 transitions. [2025-04-26 18:41:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states and 1646 transitions. [2025-04-26 18:41:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 769. [2025-04-26 18:41:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 769 states have (on average 1.694408322496749) internal successors, (in total 1303), 768 states have internal predecessors, (1303), 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,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1303 transitions. [2025-04-26 18:41:46,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 769 states and 1303 transitions. [2025-04-26 18:41:46,188 INFO L438 stractBuchiCegarLoop]: Abstraction has 769 states and 1303 transitions. [2025-04-26 18:41:46,188 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:46,188 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 769 states and 1303 transitions. [2025-04-26 18:41:46,191 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 151 [2025-04-26 18:41:46,191 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,191 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:46,191 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" [2025-04-26 18:41:46,192 INFO L754 eck$LassoCheckResult]: Loop: "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 18:41:46,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2091815994, now seen corresponding path program 2 times [2025-04-26 18:41:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999005755] [2025-04-26 18:41:46,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:46,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:46,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:46,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:46,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash 131725895, now seen corresponding path program 3 times [2025-04-26 18:41:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613521542] [2025-04-26 18:41:46,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:46,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:46,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:46,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:46,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -706862686, now seen corresponding path program 2 times [2025-04-26 18:41:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774873493] [2025-04-26 18:41:46,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:46,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:46,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:46,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,380 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:46,381 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:46,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:46,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:46,381 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:46,381 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:46,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:46,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:46,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:46,381 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:46,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:46,540 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:46,540 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:46,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,544 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,546 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,547 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,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:46,566 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,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,568 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,568 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,570 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,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,580 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:46,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,587 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:46,587 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:46,600 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:46,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,609 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,610 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,611 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,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:46,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:46,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:46,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:46,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:46,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:46,628 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:46,633 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:46,633 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:46,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:46,635 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:46,637 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:46,638 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:46,655 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:46,655 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:46,655 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:46,655 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 18:41:46,661 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:46,666 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 18:41:46,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:46,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:46,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:46,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:46,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:46,727 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,727 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,727 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 769 states and 1303 transitions. cyclomatic complexity: 587 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:46,773 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 769 states and 1303 transitions. cyclomatic complexity: 587. 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 1208 states and 2027 transitions. Complement of second has 4 states. [2025-04-26 18:41:46,773 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,774 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:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-26 18:41:46,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 18:41:46,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 18:41:46,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 15 letters. Loop has 10 letters. [2025-04-26 18:41:46,775 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:46,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1208 states and 2027 transitions. [2025-04-26 18:41:46,782 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:46,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1208 states to 815 states and 1363 transitions. [2025-04-26 18:41:46,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2025-04-26 18:41:46,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2025-04-26 18:41:46,788 INFO L74 IsDeterministic]: Start isDeterministic. Operand 815 states and 1363 transitions. [2025-04-26 18:41:46,788 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:46,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 815 states and 1363 transitions. [2025-04-26 18:41:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 1363 transitions. [2025-04-26 18:41:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 581. [2025-04-26 18:41:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 581 states have (on average 1.7607573149741824) internal successors, (in total 1023), 580 states have internal predecessors, (1023), 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,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1023 transitions. [2025-04-26 18:41:46,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 581 states and 1023 transitions. [2025-04-26 18:41:46,798 INFO L438 stractBuchiCegarLoop]: Abstraction has 581 states and 1023 transitions. [2025-04-26 18:41:46,798 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:46,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 581 states and 1023 transitions. [2025-04-26 18:41:46,800 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:46,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:46,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:46,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:46,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:46,801 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:46,801 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:46,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 764508993, now seen corresponding path program 1 times [2025-04-26 18:41:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131209489] [2025-04-26 18:41:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:46,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:46,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 2 times [2025-04-26 18:41:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987615501] [2025-04-26 18:41:46,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:46,822 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:46,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:46,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:46,824 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,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:46,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -970588316, now seen corresponding path program 1 times [2025-04-26 18:41:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:46,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037500538] [2025-04-26 18:41:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:46,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:46,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:46,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:46,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:46,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:46,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,049 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:47,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:47,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:47,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:47,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:47,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:47,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:47,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:41:47,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:47,049 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:47,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:47,329 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:47,330 INFO L453 LassoAnalysis]: Using template 'affine'. [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 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,333 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,334 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,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,352 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,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,354 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,355 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,356 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,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,370 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,375 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,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,377 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,379 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,380 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,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,394 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,402 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,404 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,405 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,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,420 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,425 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,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,427 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,429 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,431 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,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,452 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,454 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,455 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,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,468 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,474 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,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,476 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,477 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,479 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,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,494 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,500 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,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,503 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,504 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,505 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,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,524 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,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,526 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,527 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,527 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,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,542 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,558 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,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,560 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,561 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,563 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,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,573 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:47,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,593 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:47,593 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:47,630 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:47,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:47,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,637 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 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,639 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,640 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,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:47,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:47,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:47,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:47,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:47,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:47,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:47,660 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:47,660 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:47,662 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,663 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,663 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:47,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:41:47,679 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:47,679 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:47,679 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 18:41:47,685 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,688 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:47,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:47,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:47,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:47,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:47,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,733 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,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:47,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:47,745 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,745 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,746 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 581 states and 1023 transitions. cyclomatic complexity: 475 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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,775 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 581 states and 1023 transitions. cyclomatic complexity: 475. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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 1318 states and 2322 transitions. Complement of second has 5 states. [2025-04-26 18:41:47,775 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,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (in total 22), 4 states have internal predecessors, (22), 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,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-26 18:41:47,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 18:41:47,776 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 22 letters. Loop has 4 letters. [2025-04-26 18:41:47,776 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,776 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 18:41:47,777 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:47,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1318 states and 2322 transitions. [2025-04-26 18:41:47,783 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:47,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1318 states to 876 states and 1560 transitions. [2025-04-26 18:41:47,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2025-04-26 18:41:47,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2025-04-26 18:41:47,787 INFO L74 IsDeterministic]: Start isDeterministic. Operand 876 states and 1560 transitions. [2025-04-26 18:41:47,787 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:47,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 876 states and 1560 transitions. [2025-04-26 18:41:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1560 transitions. [2025-04-26 18:41:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 736. [2025-04-26 18:41:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 736 states have (on average 1.8016304347826086) internal successors, (in total 1326), 735 states have internal predecessors, (1326), 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,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1326 transitions. [2025-04-26 18:41:47,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 736 states and 1326 transitions. [2025-04-26 18:41:47,797 INFO L438 stractBuchiCegarLoop]: Abstraction has 736 states and 1326 transitions. [2025-04-26 18:41:47,797 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:47,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 736 states and 1326 transitions. [2025-04-26 18:41:47,800 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 18:41:47,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:47,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:47,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:47,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:47,800 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 18:41:47,801 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:47,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -550446966, now seen corresponding path program 1 times [2025-04-26 18:41:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203987610] [2025-04-26 18:41:47,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:47,806 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,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,806 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:47,810 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,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 3 times [2025-04-26 18:41:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138691738] [2025-04-26 18:41:47,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,817 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:47,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:47,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:47,818 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,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:47,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1294757843, now seen corresponding path program 1 times [2025-04-26 18:41:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:47,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834618091] [2025-04-26 18:41:47,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:41:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:47,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:47,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:41:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:41:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:47,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:48,076 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:48,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:48,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:48,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:48,076 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:48,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:48,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:48,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:41:48,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:48,076 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:48,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:48,398 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:48,398 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:48,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,401 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:48,402 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:48,403 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,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,422 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:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,424 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:48,424 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:48,428 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,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,449 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:48,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:41:48,452 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,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,465 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:41:48,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,473 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,474 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,475 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,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:48,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,497 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,497 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,499 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,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,519 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:48,519 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:48,521 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,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,540 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:48,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,542 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:48,543 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:48,543 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,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,557 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:48,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:41:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,564 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:48,565 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:48,566 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,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:48,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:48,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:48,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:48,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:48,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:48,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:48,589 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:48,589 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:48,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:48,590 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:48,591 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:48,592 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:48,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:41:48,607 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:48,607 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:48,607 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 18:41:48,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 18:41:48,623 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 18:41:48,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,640 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,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:48,665 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,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,679 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,679 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,679 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 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,705 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. 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 1397 states and 2390 transitions. Complement of second has 5 states. [2025-04-26 18:41:48,705 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,706 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,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 18:41:48,706 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:48,706 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,706 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:48,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,723 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,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:48,748 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,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,761 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,762 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,762 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 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,803 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. 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 2201 states and 3809 transitions. Complement of second has 7 states. [2025-04-26 18:41:48,803 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,804 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,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 18:41:48,804 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:48,804 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,804 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:48,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 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 23 of 23 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 unsat [2025-04-26 18:41:48,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:48,844 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,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:48,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:48,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:48,857 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,858 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,858 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650 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,885 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 736 states and 1326 transitions. cyclomatic complexity: 650. 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 1763 states and 3038 transitions. Complement of second has 7 states. [2025-04-26 18:41:48,885 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,885 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,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-04-26 18:41:48,885 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 18:41:48,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,886 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 27 letters. Loop has 4 letters. [2025-04-26 18:41:48,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,886 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 23 letters. Loop has 8 letters. [2025-04-26 18:41:48,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:48,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 3038 transitions. [2025-04-26 18:41:48,892 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:48,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1023 states and 1742 transitions. [2025-04-26 18:41:48,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2025-04-26 18:41:48,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-04-26 18:41:48,897 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1023 states and 1742 transitions. [2025-04-26 18:41:48,897 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:48,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1023 states and 1742 transitions. [2025-04-26 18:41:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states and 1742 transitions. [2025-04-26 18:41:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 648. [2025-04-26 18:41:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 648 states have (on average 1.6944444444444444) internal successors, (in total 1098), 647 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:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1098 transitions. [2025-04-26 18:41:48,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 648 states and 1098 transitions. [2025-04-26 18:41:48,906 INFO L438 stractBuchiCegarLoop]: Abstraction has 648 states and 1098 transitions. [2025-04-26 18:41:48,906 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:41:48,907 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 648 states and 1098 transitions. [2025-04-26 18:41:48,908 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:48,908 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:48,908 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:48,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:48,909 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:48,909 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:41:48,909 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:48,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash 811393748, now seen corresponding path program 1 times [2025-04-26 18:41:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:48,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388863249] [2025-04-26 18:41:48,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:48,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:48,914 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,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:48,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:49,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388863249] [2025-04-26 18:41:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388863249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:49,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091233593] [2025-04-26 18:41:49,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:49,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:49,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,005 INFO L229 MonitoredProcess]: Starting monitored process 40 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:49,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-26 18:41:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:41:49,031 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,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:41:49,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:49,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-26 18:41:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:49,120 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-26 18:41:49,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 10 [2025-04-26 18:41:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091233593] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:49,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-26 18:41:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107539842] [2025-04-26 18:41:49,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:49,126 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:49,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 4 times [2025-04-26 18:41:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110722108] [2025-04-26 18:41:49,126 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 18:41:49,129 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:49,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,130 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,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:49,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 18:41:49,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-26 18:41:49,174 INFO L87 Difference]: Start difference. First operand 648 states and 1098 transitions. cyclomatic complexity: 494 Second operand has 9 states, 8 states have (on average 5.375) internal successors, (in total 43), 8 states have internal predecessors, (43), 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,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:49,273 INFO L93 Difference]: Finished difference Result 1259 states and 2085 transitions. [2025-04-26 18:41:49,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 2085 transitions. [2025-04-26 18:41:49,279 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:49,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 1218 states and 2022 transitions. [2025-04-26 18:41:49,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2025-04-26 18:41:49,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2025-04-26 18:41:49,284 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1218 states and 2022 transitions. [2025-04-26 18:41:49,284 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:49,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 2022 transitions. [2025-04-26 18:41:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 2022 transitions. [2025-04-26 18:41:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 831. [2025-04-26 18:41:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 831 states have (on average 1.6859205776173285) internal successors, (in total 1401), 830 states have internal predecessors, (1401), 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,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1401 transitions. [2025-04-26 18:41:49,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1401 transitions. [2025-04-26 18:41:49,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:49,298 INFO L438 stractBuchiCegarLoop]: Abstraction has 831 states and 1401 transitions. [2025-04-26 18:41:49,298 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:41:49,298 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1401 transitions. [2025-04-26 18:41:49,300 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:49,300 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,300 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:49,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:49,301 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:41:49,301 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:49,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1097516099, now seen corresponding path program 2 times [2025-04-26 18:41:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042745311] [2025-04-26 18:41:49,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:41:49,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-04-26 18:41:49,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 18:41:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:49,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042745311] [2025-04-26 18:41:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042745311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:49,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:49,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972936456] [2025-04-26 18:41:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:49,358 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:49,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 5 times [2025-04-26 18:41:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527141899] [2025-04-26 18:41:49,359 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,361 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:49,361 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:49,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,362 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,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:49,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:49,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:49,401 INFO L87 Difference]: Start difference. First operand 831 states and 1401 transitions. cyclomatic complexity: 636 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (in total 24), 5 states have internal predecessors, (24), 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,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:49,446 INFO L93 Difference]: Finished difference Result 845 states and 1414 transitions. [2025-04-26 18:41:49,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 845 states and 1414 transitions. [2025-04-26 18:41:49,449 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:49,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 845 states to 831 states and 1400 transitions. [2025-04-26 18:41:49,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-04-26 18:41:49,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2025-04-26 18:41:49,452 INFO L74 IsDeterministic]: Start isDeterministic. Operand 831 states and 1400 transitions. [2025-04-26 18:41:49,452 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:49,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 18:41:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states and 1400 transitions. [2025-04-26 18:41:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2025-04-26 18:41:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 831 states have (on average 1.6847172081829123) internal successors, (in total 1400), 830 states have internal predecessors, (1400), 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,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1400 transitions. [2025-04-26 18:41:49,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 18:41:49,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:49,462 INFO L438 stractBuchiCegarLoop]: Abstraction has 831 states and 1400 transitions. [2025-04-26 18:41:49,463 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:41:49,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 831 states and 1400 transitions. [2025-04-26 18:41:49,464 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:49,464 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,464 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:49,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:49,465 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:41:49,465 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:49,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash 640108354, now seen corresponding path program 2 times [2025-04-26 18:41:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668017898] [2025-04-26 18:41:49,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:41:49,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:49,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668017898] [2025-04-26 18:41:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668017898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:49,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090697502] [2025-04-26 18:41:49,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:49,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,671 INFO L229 MonitoredProcess]: Starting monitored process 41 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:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-26 18:41:49,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-26 18:41:49,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:49,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:49,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 18:41:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:49,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-26 18:41:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:49,781 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-26 18:41:49,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-26 18:41:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090697502] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:49,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-04-26 18:41:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15950536] [2025-04-26 18:41:49,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:49,793 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:49,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 6 times [2025-04-26 18:41:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56256987] [2025-04-26 18:41:49,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:49,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,796 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:49,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:41:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:49,797 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,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:49,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 18:41:49,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-26 18:41:49,840 INFO L87 Difference]: Start difference. First operand 831 states and 1400 transitions. cyclomatic complexity: 635 Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (in total 50), 11 states have internal predecessors, (50), 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,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:49,978 INFO L93 Difference]: Finished difference Result 1708 states and 2826 transitions. [2025-04-26 18:41:49,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1708 states and 2826 transitions. [2025-04-26 18:41:49,983 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:49,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1708 states to 1667 states and 2757 transitions. [2025-04-26 18:41:49,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-04-26 18:41:49,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2025-04-26 18:41:49,990 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1667 states and 2757 transitions. [2025-04-26 18:41:49,990 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:49,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1667 states and 2757 transitions. [2025-04-26 18:41:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states and 2757 transitions. [2025-04-26 18:41:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1223. [2025-04-26 18:41:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1223 states have (on average 1.688470973017171) internal successors, (in total 2065), 1222 states have internal predecessors, (2065), 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,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2065 transitions. [2025-04-26 18:41:50,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1223 states and 2065 transitions. [2025-04-26 18:41:50,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 18:41:50,011 INFO L438 stractBuchiCegarLoop]: Abstraction has 1223 states and 2065 transitions. [2025-04-26 18:41:50,011 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:41:50,011 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1223 states and 2065 transitions. [2025-04-26 18:41:50,014 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:50,014 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:50,014 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:50,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:50,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:50,015 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:41:50,015 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:50,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1565367790, now seen corresponding path program 3 times [2025-04-26 18:41:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473027739] [2025-04-26 18:41:50,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-26 18:41:50,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:41:50,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:50,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:50,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473027739] [2025-04-26 18:41:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473027739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:50,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:50,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:50,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314525675] [2025-04-26 18:41:50,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:50,081 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:50,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 7 times [2025-04-26 18:41:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945477843] [2025-04-26 18:41:50,082 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,085 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,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,087 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,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:50,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:50,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:50,136 INFO L87 Difference]: Start difference. First operand 1223 states and 2065 transitions. cyclomatic complexity: 953 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (in total 30), 5 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:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:50,176 INFO L93 Difference]: Finished difference Result 1466 states and 2406 transitions. [2025-04-26 18:41:50,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1466 states and 2406 transitions. [2025-04-26 18:41:50,180 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:50,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1466 states to 1403 states and 2338 transitions. [2025-04-26 18:41:50,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2025-04-26 18:41:50,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2025-04-26 18:41:50,185 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1403 states and 2338 transitions. [2025-04-26 18:41:50,185 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:50,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1403 states and 2338 transitions. [2025-04-26 18:41:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states and 2338 transitions. [2025-04-26 18:41:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1227. [2025-04-26 18:41:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1227 states have (on average 1.6862265688671556) internal successors, (in total 2069), 1226 states have internal predecessors, (2069), 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,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2069 transitions. [2025-04-26 18:41:50,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1227 states and 2069 transitions. [2025-04-26 18:41:50,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:50,202 INFO L438 stractBuchiCegarLoop]: Abstraction has 1227 states and 2069 transitions. [2025-04-26 18:41:50,202 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:41:50,202 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1227 states and 2069 transitions. [2025-04-26 18:41:50,205 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:41:50,205 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:50,205 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:50,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:50,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:50,206 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[]" "[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[103] $Ultimate##0-->L45: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[98] L28-1-->L29: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L29-->L29-1: Formula: (and (= v_q1_back_9 (+ 1 v_q1_back_10)) (= (select v_q1_4 v_q1_back_10) 1)) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[102] L29-1-->L28-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[97] L28-1-->L35: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[99] L35-->thread1FINAL: Formula: (and (= 0 (select v_q1_6 v_q1_back_14)) (= (+ 1 v_q1_back_14) v_q1_back_13)) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[104] L45-->L46-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[112] $Ultimate##0-->L65: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[113] L65-->L66-1: Formula: v_g_3 InVars {} OutVars{g=v_g_3} AuxVars[] AssignedVars[g]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[106] L46-1-->L47: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[108] L47-->L47-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (select v_q1_10 v_q1_front_11) v_j_9) (< v_q1_front_11 v_q1_back_17)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_9} AuxVars[] AssignedVars[q1_front, j]" "[109] L47-1-->L52: Formula: (and (= (+ v_q2_back_7 1) v_q2_back_6) (= (select v_q2_3 v_q2_back_7) v_j_5)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_5} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_5} AuxVars[] AssignedVars[q2_back]" "[110] L52-->L57: Formula: (= v_s_1 (+ v_j_3 v_s_2)) InVars {s=v_s_2, j=v_j_3} OutVars{s=v_s_1, j=v_j_3} AuxVars[] AssignedVars[s]" "[111] L57-->L46-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_2} AuxVars[] AssignedVars[f]" "[105] L46-1-->thread2FINAL: Formula: (not v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:41:50,206 INFO L754 eck$LassoCheckResult]: Loop: "[115] L66-1-->L67: Formula: v_g_4 InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[117] L67-->L67-1: Formula: (and (= (select v_q2_7 v_q2_front_11) v_k_6) (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_6, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[118] L67-1-->L73: Formula: (= (+ v_k_1 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_1} OutVars{t=v_t_2, k=v_k_1} AuxVars[] AssignedVars[t]" "[119] L73-->L66-1: Formula: (let ((.cse0 (= v_k_2 0))) (or (and (not .cse0) v_g_1) (and .cse0 (not v_g_1)))) InVars {k=v_k_2} OutVars{k=v_k_2, g=v_g_1} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:50,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1636815046, now seen corresponding path program 4 times [2025-04-26 18:41:50,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271232313] [2025-04-26 18:41:50,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-26 18:41:50,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:41:50,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:50,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:41:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:41:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 4465700, now seen corresponding path program 8 times [2025-04-26 18:41:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620307665] [2025-04-26 18:41:50,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,234 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,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:50,235 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,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2144858403, now seen corresponding path program 1 times [2025-04-26 18:41:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835340038] [2025-04-26 18:41:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-26 18:41:50,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-26 18:41:50,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-26 18:41:50,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-26 18:41:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,625 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:50,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:50,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:50,626 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:50,626 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:50,626 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,626 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:50,626 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:50,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_petrified1_Iteration12_Lasso [2025-04-26 18:41:50,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:50,626 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:50,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:50,996 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:50,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,998 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:50,999 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:51,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,018 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:51,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,020 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:51,021 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:51,021 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:51,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,034 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,039 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:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,041 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:51,042 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:51,043 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:51,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,056 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,061 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:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,089 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:51,090 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:51,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,104 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:41:51,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,112 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:51,113 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:51,113 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:51,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,126 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,132 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:51,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,134 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:51,134 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:51,135 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:51,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,153 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:51,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,155 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:51,155 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:51,158 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:51,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,171 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,176 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:51,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,178 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:51,179 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:51,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:51,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,193 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,198 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:51,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,199 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:51,200 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:51,201 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:51,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,219 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:51,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,221 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:51,222 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:51,222 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:51,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,242 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:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,244 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:51,244 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:51,245 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:51,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,256 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:51,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,281 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:51,282 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:51,332 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,339 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:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,341 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:51,341 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:51,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:51,364 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:51,364 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:51,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,366 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:51,366 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:51,367 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:51,383 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:51,383 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:51,383 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:51,383 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 18:41:51,388 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:51,399 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-04-26 18:41:51,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:41:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:41:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:51,458 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,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,472 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,473 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:51,473 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1227 states and 2069 transitions. cyclomatic complexity: 953 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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,489 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1227 states and 2069 transitions. cyclomatic complexity: 953. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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 1279 states and 2150 transitions. Complement of second has 4 states. [2025-04-26 18:41:51,489 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,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 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,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 18:41:51,490 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 33 letters. Loop has 4 letters. [2025-04-26 18:41:51,490 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,490 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 37 letters. Loop has 4 letters. [2025-04-26 18:41:51,490 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,490 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 33 letters. Loop has 8 letters. [2025-04-26 18:41:51,490 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 2150 transitions. [2025-04-26 18:41:51,494 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:51,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:51,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:51,494 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:51,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:41:51,494 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:51,494 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:51,494 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:51,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,506 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:51 BoogieIcfgContainer [2025-04-26 18:41:51,506 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:51,506 INFO L158 Benchmark]: Toolchain (without parser) took 8433.34ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 90.5MB in the beginning and 137.4MB in the end (delta: -46.9MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,506 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 91.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.23ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 88.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,507 INFO L158 Benchmark]: Boogie Preprocessor took 25.99ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 87.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,507 INFO L158 Benchmark]: RCFGBuilder took 227.83ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 76.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,507 INFO L158 Benchmark]: BuchiAutomizer took 8142.89ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 76.6MB in the beginning and 137.4MB in the end (delta: -60.8MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,508 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.17ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 91.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.23ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 88.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.99ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 87.4MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 227.83ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 76.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8142.89ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 76.6MB in the beginning and 137.4MB in the end (delta: -60.8MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 6.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 2243 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 1097 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 664 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 433 mSDtfsCounter, 781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp74 ukn92 mio100 lsp61 div100 bol108 ite100 ukn100 eq192 hnf90 smp100 dnf203 smp76 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 273, Number of transitions in reduction automaton: 727, Number of states in reduction automaton: 458, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 12 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,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,918 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...