/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-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:22,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:22,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:22,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:22,730 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:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:22,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:22,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:22,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:22,753 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:22,753 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:22,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:22,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:22,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:22,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:22,755 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:22,755 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:22,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:22,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:22,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:22,974 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:22,974 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:22,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2025-04-26 18:41:22,975 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2025-04-26 18:41:22,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:22,994 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:22,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:22,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:22,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:23,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,031 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:23,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:23,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:23,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:23,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:23,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:23,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:23,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:23,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:23,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:23,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,078 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:23,081 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:23,103 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:23,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:23,103 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:23,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:23,104 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:23,104 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:23,105 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:23,145 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:23,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:23,266 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:23,266 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:23,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:23,289 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:23,290 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:23 BoogieIcfgContainer [2025-04-26 18:41:23,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:23,291 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:23,291 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:23,295 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:23,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:23,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/2) ... [2025-04-26 18:41:23,297 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5d619e and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:23, skipping insertion in model container [2025-04-26 18:41:23,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:23,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:23" (2/2) ... [2025-04-26 18:41:23,299 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2025-04-26 18:41:23,349 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:23,386 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,389 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:23,391 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:23,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 18:41:23,457 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-26 18:41:23,459 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:23,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 18:41:23,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 18:41:23,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2025-04-26 18:41:23,465 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 96 flow [2025-04-26 18:41:23,466 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 39 transitions, 96 flow [2025-04-26 18:41:23,555 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1015 states, 1013 states have (on average 2.974333662388944) internal successors, (in total 3013), 1014 states have internal predecessors, (3013), 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:23,558 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1015 states, 1013 states have (on average 2.974333662388944) internal successors, (in total 3013), 1014 states have internal predecessors, (3013), 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:23,560 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:23,767 WARN L140 AmpleReduction]: Number of pruned transitions: 1133 [2025-04-26 18:41:23,769 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:23,770 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 112 [2025-04-26 18:41:23,770 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:31 [2025-04-26 18:41:23,770 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:596 [2025-04-26 18:41:23,770 WARN L145 AmpleReduction]: Times succ was already a loop node:33 [2025-04-26 18:41:23,770 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:187 [2025-04-26 18:41:23,770 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:23,772 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:23,781 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:23,781 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:23,781 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:23,781 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:23,781 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:23,781 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:23,781 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:23,781 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:23,784 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:23,817 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 519 [2025-04-26 18:41:23,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:23,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:23,821 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:23,822 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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:23,834 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 519 [2025-04-26 18:41:23,835 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,835 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:23,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:23,840 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:23,841 INFO L754 eck$LassoCheckResult]: Loop: "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-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:23,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2025-04-26 18:41:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357749861] [2025-04-26 18:41:23,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:23,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:23,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:23,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:23,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 4188677, now seen corresponding path program 1 times [2025-04-26 18:41:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266717633] [2025-04-26 18:41:23,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:23,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:23,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:23,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:23,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1714522859, now seen corresponding path program 1 times [2025-04-26 18:41:23,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108349329] [2025-04-26 18:41:23,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:23,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:23,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:23,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,109 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:24,110 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:24,110 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:24,110 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:24,110 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:24,110 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,110 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:24,110 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:24,111 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:24,111 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:24,111 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:24,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,357 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:24,359 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:24,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,364 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:24,366 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:24,367 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:24,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,388 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,397 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:24,398 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:24,399 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:24,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:24,436 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:24,437 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,456 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:24,458 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:24,460 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:24,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,477 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:24,478 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:24,478 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:24,484 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:24,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:24,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:24,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:24,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:24,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,565 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:24,581 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:24,584 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,710 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 740 states, 738 states have (on average 1.4471544715447155) internal successors, (in total 1068), 739 states have internal predecessors, (1068), 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.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1583 states and 2371 transitions. Complement of second has 7 states. [2025-04-26 18:41:24,713 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:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 18:41:24,722 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:41:24,723 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,723 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:24,723 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,723 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 18:41:24,723 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1583 states and 2371 transitions. [2025-04-26 18:41:24,742 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:24,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1583 states to 814 states and 1170 transitions. [2025-04-26 18:41:24,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2025-04-26 18:41:24,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2025-04-26 18:41:24,759 INFO L74 IsDeterministic]: Start isDeterministic. Operand 814 states and 1170 transitions. [2025-04-26 18:41:24,760 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:24,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 814 states and 1170 transitions. [2025-04-26 18:41:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states and 1170 transitions. [2025-04-26 18:41:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 773. [2025-04-26 18:41:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 773 states have (on average 1.4605433376455368) internal successors, (in total 1129), 772 states have internal predecessors, (1129), 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:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1129 transitions. [2025-04-26 18:41:24,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 773 states and 1129 transitions. [2025-04-26 18:41:24,819 INFO L438 stractBuchiCegarLoop]: Abstraction has 773 states and 1129 transitions. [2025-04-26 18:41:24,819 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:24,819 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 773 states and 1129 transitions. [2025-04-26 18:41:24,822 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:24,823 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:24,823 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:24,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:24,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:24,823 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:24,824 INFO L754 eck$LassoCheckResult]: Loop: "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:24,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 682457567, now seen corresponding path program 1 times [2025-04-26 18:41:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131314340] [2025-04-26 18:41:24,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:24,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:24,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:24,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:24,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 26157701, now seen corresponding path program 1 times [2025-04-26 18:41:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117395797] [2025-04-26 18:41:24,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:24,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:24,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -433766941, now seen corresponding path program 1 times [2025-04-26 18:41:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710686303] [2025-04-26 18:41:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:24,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:24,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:25,112 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:25,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:25,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:25,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:25,112 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:25,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:25,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:25,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:25,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:25,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:25,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:25,439 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:25,439 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,441 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:25,443 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:25,444 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:25,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:25,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:25,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:25,460 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:25,466 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:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,467 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:25,468 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:25,469 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:25,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,479 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:25,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,507 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:25,507 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:25,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:25,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:25,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,544 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:25,545 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:25,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:25,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:25,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:25,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:25,562 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:25,571 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:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,573 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:25,574 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:25,575 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:25,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:25,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:25,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:25,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:25,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:25,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:25,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:25,606 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:25,606 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:25,608 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:25,609 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:25,610 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:25,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:25,627 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:25,627 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:25,627 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:25,634 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:25,635 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:25,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:25,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:25,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:25,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:25,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:25,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:25,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:25,712 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:25,712 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:25,713 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 773 states and 1129 transitions. cyclomatic complexity: 394 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:25,753 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 773 states and 1129 transitions. cyclomatic complexity: 394. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1326 states and 1900 transitions. Complement of second has 5 states. [2025-04-26 18:41:25,753 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:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-26 18:41:25,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 18:41:25,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 16 letters. Loop has 6 letters. [2025-04-26 18:41:25,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 10 letters. Loop has 12 letters. [2025-04-26 18:41:25,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1326 states and 1900 transitions. [2025-04-26 18:41:25,765 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 226 [2025-04-26 18:41:25,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1326 states to 1112 states and 1606 transitions. [2025-04-26 18:41:25,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 547 [2025-04-26 18:41:25,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2025-04-26 18:41:25,776 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1112 states and 1606 transitions. [2025-04-26 18:41:25,776 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:25,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1112 states and 1606 transitions. [2025-04-26 18:41:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states and 1606 transitions. [2025-04-26 18:41:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 987. [2025-04-26 18:41:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 987 states have (on average 1.4569402228976698) internal successors, (in total 1438), 986 states have internal predecessors, (1438), 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:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1438 transitions. [2025-04-26 18:41:25,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 987 states and 1438 transitions. [2025-04-26 18:41:25,795 INFO L438 stractBuchiCegarLoop]: Abstraction has 987 states and 1438 transitions. [2025-04-26 18:41:25,795 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:25,795 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 987 states and 1438 transitions. [2025-04-26 18:41:25,799 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:25,799 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:25,799 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:25,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:25,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:25,800 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[117] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:25,800 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:25,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 954905804, now seen corresponding path program 1 times [2025-04-26 18:41:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:25,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101107726] [2025-04-26 18:41:25,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:25,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:25,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:25,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:25,839 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:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:25,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101107726] [2025-04-26 18:41:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101107726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:25,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:25,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919062368] [2025-04-26 18:41:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:25,845 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:25,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 1 times [2025-04-26 18:41:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:25,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659245919] [2025-04-26 18:41:25,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:25,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:25,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:25,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:25,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:25,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:25,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:25,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:25,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:25,931 INFO L87 Difference]: Start difference. First operand 987 states and 1438 transitions. cyclomatic complexity: 497 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:25,982 INFO L93 Difference]: Finished difference Result 1073 states and 1553 transitions. [2025-04-26 18:41:25,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1553 transitions. [2025-04-26 18:41:26,002 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:26,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 1068 states and 1548 transitions. [2025-04-26 18:41:26,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 538 [2025-04-26 18:41:26,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 538 [2025-04-26 18:41:26,010 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1068 states and 1548 transitions. [2025-04-26 18:41:26,010 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:26,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1068 states and 1548 transitions. [2025-04-26 18:41:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states and 1548 transitions. [2025-04-26 18:41:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1047. [2025-04-26 18:41:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1047 states have (on average 1.448901623686724) internal successors, (in total 1517), 1046 states have internal predecessors, (1517), 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:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1517 transitions. [2025-04-26 18:41:26,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1047 states and 1517 transitions. [2025-04-26 18:41:26,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:26,036 INFO L438 stractBuchiCegarLoop]: Abstraction has 1047 states and 1517 transitions. [2025-04-26 18:41:26,036 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:26,036 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1047 states and 1517 transitions. [2025-04-26 18:41:26,040 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:26,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:26,040 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:26,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:26,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:26,041 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:26,041 INFO L754 eck$LassoCheckResult]: Loop: "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:26,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 901811640, now seen corresponding path program 1 times [2025-04-26 18:41:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090620717] [2025-04-26 18:41:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:26,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:26,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:26,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:26,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 84370301, now seen corresponding path program 2 times [2025-04-26 18:41:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642760089] [2025-04-26 18:41:26,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:26,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:26,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:26,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:26,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:26,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1979806732, now seen corresponding path program 1 times [2025-04-26 18:41:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027872510] [2025-04-26 18:41:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:41:26,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:41:26,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:41:26,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,351 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:26,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:26,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:26,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:26,351 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:26,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:26,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:26,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:26,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:26,351 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:26,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:26,558 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:26,558 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,560 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:26,561 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:26,562 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:26,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,588 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:26,600 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:26,600 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:26,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,614 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:26,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,622 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:26,624 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:26,624 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:26,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:26,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:26,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:26,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:26,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:26,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:26,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:26,650 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:41:26,650 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,652 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:26,653 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:26,654 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:26,670 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:26,670 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:26,670 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:26,671 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:26,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:26,684 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:41:26,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:41:26,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:41:26,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:26,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:26,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:26,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:26,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:26,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:26,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:26,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:26,756 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:26,756 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:26,756 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1047 states and 1517 transitions. cyclomatic complexity: 519 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,797 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1047 states and 1517 transitions. cyclomatic complexity: 519. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1781 states and 2535 transitions. Complement of second has 5 states. [2025-04-26 18:41:26,798 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:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-26 18:41:26,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 18:41:26,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,799 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 24 letters. Loop has 6 letters. [2025-04-26 18:41:26,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,799 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 18 letters. Loop has 12 letters. [2025-04-26 18:41:26,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:26,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1781 states and 2535 transitions. [2025-04-26 18:41:26,808 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 226 [2025-04-26 18:41:26,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1781 states to 1399 states and 1992 transitions. [2025-04-26 18:41:26,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 667 [2025-04-26 18:41:26,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2025-04-26 18:41:26,815 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1399 states and 1992 transitions. [2025-04-26 18:41:26,816 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:26,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1399 states and 1992 transitions. [2025-04-26 18:41:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states and 1992 transitions. [2025-04-26 18:41:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1080. [2025-04-26 18:41:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.45) internal successors, (in total 1566), 1079 states have internal predecessors, (1566), 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:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1566 transitions. [2025-04-26 18:41:26,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1080 states and 1566 transitions. [2025-04-26 18:41:26,838 INFO L438 stractBuchiCegarLoop]: Abstraction has 1080 states and 1566 transitions. [2025-04-26 18:41:26,838 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:26,838 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 1566 transitions. [2025-04-26 18:41:26,842 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:26,842 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:26,842 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:26,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:26,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:26,843 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:26,843 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:26,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1259012739, now seen corresponding path program 1 times [2025-04-26 18:41:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280964708] [2025-04-26 18:41:26,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:26,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:26,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:26,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 2 times [2025-04-26 18:41:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027560429] [2025-04-26 18:41:26,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:26,876 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:26,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:26,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:26,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash -635789789, now seen corresponding path program 1 times [2025-04-26 18:41:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:26,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584430953] [2025-04-26 18:41:26,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:26,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:26,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:26,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 18:41:26,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 18:41:26,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:26,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:26,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:27,247 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:27,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:27,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:27,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:27,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:27,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:27,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:27,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:27,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:27,247 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:27,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,537 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:27,537 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,539 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:27,540 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:27,542 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:27,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,555 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,566 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:27,567 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:27,569 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:27,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,593 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:27,594 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:27,595 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:27,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,608 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,614 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:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,616 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:27,617 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:27,618 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:27,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,638 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:27,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,651 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:27,652 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:27,653 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:27,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,673 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:27,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,675 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:27,677 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:27,678 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:27,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,694 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,702 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:27,703 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:27,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:27,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,717 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,725 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:27,726 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:27,728 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:27,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,749 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:27,750 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:27,752 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:27,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,765 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,771 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:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,773 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:27,774 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:27,776 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:27,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:27,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:27,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:27,799 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:27,799 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,801 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:27,802 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:27,802 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:27,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:41:27,817 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:27,817 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:27,817 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:27,822 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:27,823 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:27,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:27,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:41:27,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:41:27,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:27,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:27,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:27,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:27,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:27,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:27,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:27,891 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:27,892 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:27,892 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1080 states and 1566 transitions. cyclomatic complexity: 537 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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:27,940 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1080 states and 1566 transitions. cyclomatic complexity: 537. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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 2417 states and 3482 transitions. Complement of second has 5 states. [2025-04-26 18:41:27,944 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:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 4 states have internal predecessors, (25), 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:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-26 18:41:27,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 20 letters. Loop has 5 letters. [2025-04-26 18:41:27,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:27,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 25 letters. Loop has 5 letters. [2025-04-26 18:41:27,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:27,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 20 letters. Loop has 10 letters. [2025-04-26 18:41:27,946 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:27,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2417 states and 3482 transitions. [2025-04-26 18:41:27,962 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:27,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2417 states to 1761 states and 2548 transitions. [2025-04-26 18:41:27,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2025-04-26 18:41:27,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 780 [2025-04-26 18:41:27,973 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1761 states and 2548 transitions. [2025-04-26 18:41:27,973 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:27,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1761 states and 2548 transitions. [2025-04-26 18:41:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states and 2548 transitions. [2025-04-26 18:41:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1518. [2025-04-26 18:41:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1518 states have (on average 1.4749670619235837) internal successors, (in total 2239), 1517 states have internal predecessors, (2239), 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:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2239 transitions. [2025-04-26 18:41:28,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1518 states and 2239 transitions. [2025-04-26 18:41:28,019 INFO L438 stractBuchiCegarLoop]: Abstraction has 1518 states and 2239 transitions. [2025-04-26 18:41:28,019 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:28,019 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1518 states and 2239 transitions. [2025-04-26 18:41:28,025 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 191 [2025-04-26 18:41:28,025 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:28,025 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:28,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:28,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:28,027 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:41:28,027 INFO L754 eck$LassoCheckResult]: Loop: "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:28,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1693929302, now seen corresponding path program 2 times [2025-04-26 18:41:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875072311] [2025-04-26 18:41:28,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:28,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:28,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:28,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:28,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:28,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 84370301, now seen corresponding path program 3 times [2025-04-26 18:41:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086016701] [2025-04-26 18:41:28,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:28,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:28,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:28,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:28,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:28,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 830021394, now seen corresponding path program 2 times [2025-04-26 18:41:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877124252] [2025-04-26 18:41:28,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:28,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:28,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:28,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:41:28,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:41:28,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,324 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:28,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:28,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:28,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:28,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:28,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:28,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:28,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:41:28,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:28,324 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:28,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,534 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:28,534 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,536 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:28,537 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:28,539 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:28,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:28,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:28,552 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:28,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:41:28,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,559 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:28,560 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:28,561 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:28,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:28,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:28,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:28,581 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:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,583 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:28,583 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:28,584 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:28,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:28,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:28,598 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:28,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:41:28,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,605 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:28,605 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:28,606 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:28,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:28,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:28,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:28,634 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:28,634 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:28,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,636 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:28,637 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:28,638 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:28,656 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:28,656 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:28,656 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:28,656 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:28,663 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:28,666 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:41:28,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:28,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:28,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:28,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:28,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:28,744 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:28,744 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:28,745 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1518 states and 2239 transitions. cyclomatic complexity: 814 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,773 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1518 states and 2239 transitions. cyclomatic complexity: 814. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2331 states and 3551 transitions. Complement of second has 4 states. [2025-04-26 18:41:28,774 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:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-26 18:41:28,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 22 letters. Loop has 6 letters. [2025-04-26 18:41:28,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 28 letters. Loop has 6 letters. [2025-04-26 18:41:28,775 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,775 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 75 transitions. Stem has 22 letters. Loop has 12 letters. [2025-04-26 18:41:28,775 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2331 states and 3551 transitions. [2025-04-26 18:41:28,785 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:28,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2331 states to 1695 states and 2511 transitions. [2025-04-26 18:41:28,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2025-04-26 18:41:28,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2025-04-26 18:41:28,792 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1695 states and 2511 transitions. [2025-04-26 18:41:28,792 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:28,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1695 states and 2511 transitions. [2025-04-26 18:41:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states and 2511 transitions. [2025-04-26 18:41:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1223. [2025-04-26 18:41:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1223 states have (on average 1.5110384300899429) internal successors, (in total 1848), 1222 states have internal predecessors, (1848), 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:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1848 transitions. [2025-04-26 18:41:28,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1223 states and 1848 transitions. [2025-04-26 18:41:28,811 INFO L438 stractBuchiCegarLoop]: Abstraction has 1223 states and 1848 transitions. [2025-04-26 18:41:28,811 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:28,812 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1223 states and 1848 transitions. [2025-04-26 18:41:28,815 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:28,815 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:28,815 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:28,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:28,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:28,816 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:28,816 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:28,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash 153536800, now seen corresponding path program 1 times [2025-04-26 18:41:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338653168] [2025-04-26 18:41:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:28,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:28,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,922 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:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:28,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338653168] [2025-04-26 18:41:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338653168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:28,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093729249] [2025-04-26 18:41:28,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,924 INFO L229 MonitoredProcess]: Starting monitored process 31 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:28,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-26 18:41:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:41:28,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:41:28,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,001 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:29,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:29,059 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-26 18:41:29,060 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:29,067 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:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093729249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:29,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:29,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-26 18:41:29,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371634982] [2025-04-26 18:41:29,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:29,068 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:29,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 3 times [2025-04-26 18:41:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581239384] [2025-04-26 18:41:29,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:29,074 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:29,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:29,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:29,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:29,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 18:41:29,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-26 18:41:29,137 INFO L87 Difference]: Start difference. First operand 1223 states and 1848 transitions. cyclomatic complexity: 695 Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (in total 45), 7 states have internal predecessors, (45), 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:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:29,230 INFO L93 Difference]: Finished difference Result 2300 states and 3409 transitions. [2025-04-26 18:41:29,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2300 states and 3409 transitions. [2025-04-26 18:41:29,250 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:29,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2300 states to 2233 states and 3297 transitions. [2025-04-26 18:41:29,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2025-04-26 18:41:29,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2025-04-26 18:41:29,260 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 3297 transitions. [2025-04-26 18:41:29,260 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 3297 transitions. [2025-04-26 18:41:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 3297 transitions. [2025-04-26 18:41:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1548. [2025-04-26 18:41:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1548 states have (on average 1.5161498708010337) internal successors, (in total 2347), 1547 states have internal predecessors, (2347), 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:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2347 transitions. [2025-04-26 18:41:29,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1548 states and 2347 transitions. [2025-04-26 18:41:29,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:29,287 INFO L438 stractBuchiCegarLoop]: Abstraction has 1548 states and 2347 transitions. [2025-04-26 18:41:29,287 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:41:29,287 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1548 states and 2347 transitions. [2025-04-26 18:41:29,290 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:29,291 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:29,291 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:29,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:29,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:29,293 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:29,293 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:29,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 899521705, now seen corresponding path program 2 times [2025-04-26 18:41:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483424343] [2025-04-26 18:41:29,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 18:41:29,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 32 statements. [2025-04-26 18:41:29,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:29,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,353 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:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:29,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483424343] [2025-04-26 18:41:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483424343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860045871] [2025-04-26 18:41:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:29,354 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:29,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 4 times [2025-04-26 18:41:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769244225] [2025-04-26 18:41:29,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:29,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 18:41:29,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:29,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:29,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:29,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:29,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:29,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:29,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:29,412 INFO L87 Difference]: Start difference. First operand 1548 states and 2347 transitions. cyclomatic complexity: 892 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:29,441 INFO L93 Difference]: Finished difference Result 1577 states and 2378 transitions. [2025-04-26 18:41:29,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1577 states and 2378 transitions. [2025-04-26 18:41:29,445 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:29,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1577 states to 1559 states and 2360 transitions. [2025-04-26 18:41:29,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 495 [2025-04-26 18:41:29,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 495 [2025-04-26 18:41:29,451 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1559 states and 2360 transitions. [2025-04-26 18:41:29,451 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1559 states and 2360 transitions. [2025-04-26 18:41:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states and 2360 transitions. [2025-04-26 18:41:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1548. [2025-04-26 18:41:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1548 states have (on average 1.5155038759689923) internal successors, (in total 2346), 1547 states have internal predecessors, (2346), 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:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2346 transitions. [2025-04-26 18:41:29,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1548 states and 2346 transitions. [2025-04-26 18:41:29,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:29,473 INFO L438 stractBuchiCegarLoop]: Abstraction has 1548 states and 2346 transitions. [2025-04-26 18:41:29,473 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:41:29,473 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1548 states and 2346 transitions. [2025-04-26 18:41:29,476 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:29,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:29,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:29,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:29,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:29,477 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:29,477 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:29,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 799351218, now seen corresponding path program 2 times [2025-04-26 18:41:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084961460] [2025-04-26 18:41:29,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:29,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-26 18:41:29,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:41:29,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:29,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,716 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:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:29,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084961460] [2025-04-26 18:41:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084961460] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:29,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819014806] [2025-04-26 18:41:29,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:29,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,718 INFO L229 MonitoredProcess]: Starting monitored process 32 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:29,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-26 18:41:29,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-26 18:41:29,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:41:29,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 18:41:29,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,837 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:29,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:41:29,880 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-26 18:41:29,880 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 15 treesize of output 14 [2025-04-26 18:41:29,893 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:29,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819014806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:41:29,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:41:29,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-26 18:41:29,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732266879] [2025-04-26 18:41:29,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:41:29,893 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:29,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 5 times [2025-04-26 18:41:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564118655] [2025-04-26 18:41:29,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:41:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:29,897 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:29,897 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:29,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:29,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:29,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-26 18:41:29,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-26 18:41:29,952 INFO L87 Difference]: Start difference. First operand 1548 states and 2346 transitions. cyclomatic complexity: 891 Second operand has 15 states, 14 states have (on average 5.428571428571429) internal successors, (in total 76), 14 states have internal predecessors, (76), 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:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:30,107 INFO L93 Difference]: Finished difference Result 3151 states and 4687 transitions. [2025-04-26 18:41:30,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3151 states and 4687 transitions. [2025-04-26 18:41:30,116 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:30,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3151 states to 3082 states and 4551 transitions. [2025-04-26 18:41:30,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 924 [2025-04-26 18:41:30,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 924 [2025-04-26 18:41:30,127 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3082 states and 4551 transitions. [2025-04-26 18:41:30,127 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:30,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3082 states and 4551 transitions. [2025-04-26 18:41:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states and 4551 transitions. [2025-04-26 18:41:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2323. [2025-04-26 18:41:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2323 states have (on average 1.5101162290142058) internal successors, (in total 3508), 2322 states have internal predecessors, (3508), 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:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3508 transitions. [2025-04-26 18:41:30,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2323 states and 3508 transitions. [2025-04-26 18:41:30,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 18:41:30,158 INFO L438 stractBuchiCegarLoop]: Abstraction has 2323 states and 3508 transitions. [2025-04-26 18:41:30,158 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:41:30,158 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2323 states and 3508 transitions. [2025-04-26 18:41:30,162 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:30,162 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:30,162 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:30,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:30,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:30,163 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:30,163 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:30,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1272836468, now seen corresponding path program 3 times [2025-04-26 18:41:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249696851] [2025-04-26 18:41:30,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-26 18:41:30,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 18:41:30,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 18:41:30,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:30,238 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:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:30,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249696851] [2025-04-26 18:41:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249696851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:30,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580569622] [2025-04-26 18:41:30,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:30,239 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:30,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 6 times [2025-04-26 18:41:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574992796] [2025-04-26 18:41:30,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:41:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,241 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:30,242 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:30,242 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:41:30,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:30,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:30,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:30,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:30,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:30,295 INFO L87 Difference]: Start difference. First operand 2323 states and 3508 transitions. cyclomatic complexity: 1332 Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (in total 35), 5 states have internal predecessors, (35), 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:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:30,330 INFO L93 Difference]: Finished difference Result 2429 states and 3632 transitions. [2025-04-26 18:41:30,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2429 states and 3632 transitions. [2025-04-26 18:41:30,337 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:30,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2429 states to 2358 states and 3556 transitions. [2025-04-26 18:41:30,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2025-04-26 18:41:30,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 672 [2025-04-26 18:41:30,346 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2358 states and 3556 transitions. [2025-04-26 18:41:30,346 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:30,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2358 states and 3556 transitions. [2025-04-26 18:41:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states and 3556 transitions. [2025-04-26 18:41:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2330. [2025-04-26 18:41:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2330 states have (on average 1.5090128755364807) internal successors, (in total 3516), 2329 states have internal predecessors, (3516), 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:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3516 transitions. [2025-04-26 18:41:30,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2330 states and 3516 transitions. [2025-04-26 18:41:30,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:30,378 INFO L438 stractBuchiCegarLoop]: Abstraction has 2330 states and 3516 transitions. [2025-04-26 18:41:30,378 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:41:30,378 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2330 states and 3516 transitions. [2025-04-26 18:41:30,382 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 35 [2025-04-26 18:41:30,382 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:30,382 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:30,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:30,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:30,383 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[106] L32-1-->L33: 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[]" "[108] L33-->L33-1: Formula: (and (= 1 (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]" "[110] L33-1-->L38: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[113] $Ultimate##0-->L51: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[112] L38-->L32-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[105] L32-1-->L40: 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[]" "[107] L40-->L40-1: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) 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]" "[109] L40-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[114] L51-->L52-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[123] $Ultimate##0-->L72: Formula: (= v_t_4 0) InVars {} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[124] L72-->L73-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[116] L52-1-->L53: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[118] L53-->L53-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]" "[119] L53-1-->L58: 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]" "[120] L58-->L63: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[121] L63-->L64: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[122] L64-->L52-1: Formula: (let ((.cse0 (= v_j_4 0))) (or (and .cse0 (not v_f_3)) (and (not .cse0) v_f_3))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_3} AuxVars[] AssignedVars[f]" "[115] L52-1-->thread2FINAL: Formula: (not v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:30,383 INFO L754 eck$LassoCheckResult]: Loop: "[126] L73-1-->L74: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[128] L74-->L74-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]" "[129] L74-1-->L80: Formula: (= (+ v_k_2 v_t_3) v_t_2) InVars {t=v_t_3, k=v_k_2} OutVars{t=v_t_2, k=v_k_2} AuxVars[] AssignedVars[t]" "[130] L80-->L81: Formula: (= (+ v_C_4 v_z_4) v_z_3) InVars {C=v_C_4, z=v_z_4} OutVars{C=v_C_4, z=v_z_3} AuxVars[] AssignedVars[z]" "[131] L81-->L73-1: Formula: (let ((.cse0 (= v_k_3 0))) (or (and (not .cse0) v_g_2) (and .cse0 (not v_g_2)))) InVars {k=v_k_3} OutVars{k=v_k_3, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 18:41:30,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash -242194312, now seen corresponding path program 4 times [2025-04-26 18:41:30,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740681604] [2025-04-26 18:41:30,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-26 18:41:30,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:41:30,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:30,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:41:30,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:41:30,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 148934175, now seen corresponding path program 7 times [2025-04-26 18:41:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391870370] [2025-04-26 18:41:30,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:41:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:30,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -731785208, now seen corresponding path program 1 times [2025-04-26 18:41:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087352871] [2025-04-26 18:41:30,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 18:41:30,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 18:41:30,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 18:41:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 18:41:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,969 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:30,969 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:30,969 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:30,969 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:30,969 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:30,969 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,969 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:30,969 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:30,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_petrified1_Iteration11_Lasso [2025-04-26 18:41:30,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:30,969 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:30,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:31,393 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:31,394 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:31,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,397 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:31,398 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:31,399 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:31,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:31,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:31,413 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:31,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,421 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:31,422 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:31,424 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:31,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:31,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:31,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:31,443 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:31,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,445 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:31,446 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:31,447 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:31,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:31,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:31,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:31,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:31,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:31,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:31,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:31,469 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:31,470 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:41:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:31,471 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:31,472 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:31,473 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:31,488 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:31,488 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:31,488 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:31,488 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 18:41:31,495 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:31,505 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-04-26 18:41:31,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:31,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 18:41:31,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 18:41:31,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:31,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:31,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:31,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:31,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:31,588 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:31,588 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:31,589 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2330 states and 3516 transitions. cyclomatic complexity: 1333 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:31,618 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2330 states and 3516 transitions. cyclomatic complexity: 1333. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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 2468 states and 3721 transitions. Complement of second has 4 states. [2025-04-26 18:41:31,619 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:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (in total 28), 4 states have internal predecessors, (28), 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:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-26 18:41:31,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 39 letters. Loop has 5 letters. [2025-04-26 18:41:31,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 44 letters. Loop has 5 letters. [2025-04-26 18:41:31,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 59 transitions. Stem has 39 letters. Loop has 10 letters. [2025-04-26 18:41:31,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:31,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2468 states and 3721 transitions. [2025-04-26 18:41:31,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:31,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2468 states to 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:31,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:31,628 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:31,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:41:31,628 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:31,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:31,628 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:31,639 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:31,640 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:31 BoogieIcfgContainer [2025-04-26 18:41:31,640 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:31,641 INFO L158 Benchmark]: Toolchain (without parser) took 8646.62ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 74.3MB in the beginning and 124.0MB in the end (delta: -49.7MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:31,641 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:31,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.30ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:31,641 INFO L158 Benchmark]: Boogie Preprocessor took 17.03ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:31,641 INFO L158 Benchmark]: RCFGBuilder took 239.71ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 60.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:31,642 INFO L158 Benchmark]: BuchiAutomizer took 8349.07ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 60.1MB in the beginning and 124.0MB in the end (delta: -64.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2025-04-26 18:41:31,642 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.30ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 72.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.03ms. Allocated memory is still 142.6MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 239.71ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 60.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8349.07ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 60.1MB in the beginning and 124.0MB in the end (delta: -64.0MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 12 iterations. TraceHistogramMax:3. 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 10. Automata minimization 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 2704 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 1137 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 408 mSDtfsCounter, 652 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp57 ukn91 mio100 lsp62 div100 bol108 ite100 ukn100 eq190 hnf91 smp100 dnf205 smp78 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 69ms 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.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 388, Number of transitions in reduction automaton: 1068, Number of states in reduction automaton: 740, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (5 trivial, 6 deterministic, 0 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 q2_back + -1 * q2_front 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. 5 modules have a trivial ranking function, the largest among these consists of 15 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:31,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:31,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-26 18:41:32,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...