/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/POPL2023/map-aggr-update1-3modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:02,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:02,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:02,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:02,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:02,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:02,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:02,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:02,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:02,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:02,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:02,304 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:02,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:02,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:02,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:02,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:02,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:02,306 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:02,306 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:02,306 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:02,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:02,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:02,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:02,528 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:02,529 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:02,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-3modifiers.bpl [2025-04-26 18:39:02,530 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-3modifiers.bpl' [2025-04-26 18:39:02,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:02,551 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:02,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:02,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:02,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,591 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:02,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:02,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:02,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:02,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:02,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:02,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/1) ... [2025-04-26 18:39:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:02,638 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:39:02,641 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:39:02,664 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:02,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:02,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:02,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:02,666 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:39:02,703 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:02,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:02,802 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:02,803 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:02,809 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:02,810 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:02,810 INFO L201 PluginConnector]: Adding new model map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:02 BoogieIcfgContainer [2025-04-26 18:39:02,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:02,811 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:02,811 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:02,815 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:02,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:02,815 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:02" (1/2) ... [2025-04-26 18:39:02,816 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d79741e and model type map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:02, skipping insertion in model container [2025-04-26 18:39:02,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:02,818 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:02" (2/2) ... [2025-04-26 18:39:02,818 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-3modifiers.bpl [2025-04-26 18:39:02,877 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:39:02,912 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:02,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:02,914 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:39:02,915 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:39:02,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 155 flow [2025-04-26 18:39:02,985 INFO L116 PetriNetUnfolderBase]: 7/50 cut-off events. [2025-04-26 18:39:02,988 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:39:02,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 50 events. 7/50 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 134 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-04-26 18:39:02,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 155 flow [2025-04-26 18:39:02,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 50 transitions, 130 flow [2025-04-26 18:39:02,996 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 59 places, 50 transitions, 130 flow [2025-04-26 18:39:02,997 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 50 transitions, 130 flow [2025-04-26 18:39:03,665 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17970 states, 17968 states have (on average 5.151491540516473) internal successors, (in total 92562), 17969 states have internal predecessors, (92562), 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:39:03,717 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 17970 states, 17968 states have (on average 5.151491540516473) internal successors, (in total 92562), 17969 states have internal predecessors, (92562), 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:39:03,719 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:04,641 WARN L140 AmpleReduction]: Number of pruned transitions: 20074 [2025-04-26 18:39:04,642 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:04,643 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1621 [2025-04-26 18:39:04,643 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:51 [2025-04-26 18:39:04,643 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5167 [2025-04-26 18:39:04,643 WARN L145 AmpleReduction]: Times succ was already a loop node:1271 [2025-04-26 18:39:04,644 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:4020 [2025-04-26 18:39:04,644 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:04,659 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 6840 states, 6838 states have (on average 2.278882714243931) internal successors, (in total 15583), 6839 states have internal predecessors, (15583), 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:39:04,666 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:04,666 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:04,666 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:04,666 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:04,666 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:04,667 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:04,667 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:04,667 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:04,677 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6840 states, 6838 states have (on average 2.278882714243931) internal successors, (in total 15583), 6839 states have internal predecessors, (15583), 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:39:04,805 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 5337 [2025-04-26 18:39:04,806 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:04,806 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:04,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:04,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:04,810 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:04,819 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6840 states, 6838 states have (on average 2.278882714243931) internal successors, (in total 15583), 6839 states have internal predecessors, (15583), 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:39:04,898 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 5337 [2025-04-26 18:39:04,898 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:04,898 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:04,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:04,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:04,903 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 18:39:04,903 INFO L754 eck$LassoCheckResult]: Loop: "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" [2025-04-26 18:39:04,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 120717, now seen corresponding path program 1 times [2025-04-26 18:39:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254511157] [2025-04-26 18:39:04,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:04,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:04,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:04,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:04,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:04,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:04,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:04,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:04,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2025-04-26 18:39:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:04,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759635251] [2025-04-26 18:39:04,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:04,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:05,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -698589770, now seen corresponding path program 1 times [2025-04-26 18:39:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:05,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918527860] [2025-04-26 18:39:05,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:05,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:05,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:05,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:05,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:05,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:05,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:05,200 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:05,201 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:05,201 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:05,201 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:05,201 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:05,201 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,201 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:05,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:05,218 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:05,218 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:05,219 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:05,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:05,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:05,362 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:05,365 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,369 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:39:05,370 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:39:05,372 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:39:05,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:05,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:05,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:05,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:05,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,405 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:39:05,407 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:39:05,409 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:39:05,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:05,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:05,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:05,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:05,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:05,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:05,437 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:05,451 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:39:05,452 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:05,473 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:39:05,474 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:39:05,476 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:05,494 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:39:05,495 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:05,495 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:05,496 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread1Thread1of1ForFork2_i) = 1*N - 1*thread1Thread1of1ForFork2_i Supporting invariants [] [2025-04-26 18:39:05,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:05,505 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:05,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:05,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:05,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:05,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:05,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:05,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:05,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:05,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:05,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:05,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:05,579 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:39:05,597 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:39:05,606 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 6840 states, 6838 states have (on average 2.278882714243931) internal successors, (in total 15583), 6839 states have internal predecessors, (15583), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:05,964 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 6840 states, 6838 states have (on average 2.278882714243931) internal successors, (in total 15583), 6839 states have internal predecessors, (15583), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 15758 states and 35731 transitions. Complement of second has 6 states. [2025-04-26 18:39:05,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-26 18:39:05,974 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:39:05,975 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,975 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:39:05,975 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,975 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:39:05,976 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:05,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15758 states and 35731 transitions. [2025-04-26 18:39:06,115 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1122 [2025-04-26 18:39:06,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15758 states to 9236 states and 20472 transitions. [2025-04-26 18:39:06,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2169 [2025-04-26 18:39:06,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4219 [2025-04-26 18:39:06,226 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9236 states and 20472 transitions. [2025-04-26 18:39:06,226 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:06,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9236 states and 20472 transitions. [2025-04-26 18:39:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9236 states and 20472 transitions. [2025-04-26 18:39:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9236 to 7958. [2025-04-26 18:39:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7958 states, 7958 states have (on average 2.3180447348580047) internal successors, (in total 18447), 7957 states have internal predecessors, (18447), 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:39:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 18447 transitions. [2025-04-26 18:39:06,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7958 states and 18447 transitions. [2025-04-26 18:39:06,580 INFO L438 stractBuchiCegarLoop]: Abstraction has 7958 states and 18447 transitions. [2025-04-26 18:39:06,580 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:06,580 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7958 states and 18447 transitions. [2025-04-26 18:39:06,614 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1122 [2025-04-26 18:39:06,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:06,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:06,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:06,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:06,615 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 18:39:06,615 INFO L754 eck$LassoCheckResult]: Loop: "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 18:39:06,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1330780479, now seen corresponding path program 1 times [2025-04-26 18:39:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:06,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523341011] [2025-04-26 18:39:06,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:06,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:06,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:06,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:06,685 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:39:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:06,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523341011] [2025-04-26 18:39:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523341011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:06,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:06,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664727996] [2025-04-26 18:39:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:06,693 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:06,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 4158918, now seen corresponding path program 1 times [2025-04-26 18:39:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:06,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405765520] [2025-04-26 18:39:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:06,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:06,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:06,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:06,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:06,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:06,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:06,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:06,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:06,735 INFO L87 Difference]: Start difference. First operand 7958 states and 18447 transitions. cyclomatic complexity: 10864 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:06,863 INFO L93 Difference]: Finished difference Result 7958 states and 18446 transitions. [2025-04-26 18:39:06,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7958 states and 18446 transitions. [2025-04-26 18:39:06,902 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1122 [2025-04-26 18:39:06,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7958 states to 7958 states and 18446 transitions. [2025-04-26 18:39:06,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2941 [2025-04-26 18:39:06,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2941 [2025-04-26 18:39:06,962 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7958 states and 18446 transitions. [2025-04-26 18:39:06,962 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:06,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7958 states and 18446 transitions. [2025-04-26 18:39:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states and 18446 transitions. [2025-04-26 18:39:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 7958. [2025-04-26 18:39:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7958 states, 7958 states have (on average 2.3179190751445087) internal successors, (in total 18446), 7957 states have internal predecessors, (18446), 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:39:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 18446 transitions. [2025-04-26 18:39:07,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7958 states and 18446 transitions. [2025-04-26 18:39:07,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:07,173 INFO L438 stractBuchiCegarLoop]: Abstraction has 7958 states and 18446 transitions. [2025-04-26 18:39:07,173 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:07,173 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7958 states and 18446 transitions. [2025-04-26 18:39:07,203 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 1122 [2025-04-26 18:39:07,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:07,204 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:07,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:07,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:07,206 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 18:39:07,206 INFO L754 eck$LassoCheckResult]: Loop: "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" [2025-04-26 18:39:07,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1309814216, now seen corresponding path program 1 times [2025-04-26 18:39:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291492197] [2025-04-26 18:39:07,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:07,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:07,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:07,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:07,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash 4158918, now seen corresponding path program 2 times [2025-04-26 18:39:07,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295659181] [2025-04-26 18:39:07,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:07,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:07,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:07,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:07,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:07,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2047126403, now seen corresponding path program 1 times [2025-04-26 18:39:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:07,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753099644] [2025-04-26 18:39:07,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:07,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:07,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:07,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:07,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:07,434 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:07,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:07,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:07,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:07,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:07,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:07,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:07,435 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:07,435 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:07,435 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:07,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:07,718 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:07,718 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:07,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,721 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:39:07,722 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:39:07,723 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:39:07,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:07,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,740 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:07,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,748 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:39:07,749 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:39:07,750 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:39:07,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:07,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,768 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:07,774 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:39:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,776 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:39:07,777 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:39:07,779 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:39:07,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:07,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,794 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:07,800 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:39:07,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,802 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:39:07,802 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:39:07,804 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:39:07,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:07,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:07,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:07,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:07,822 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:39:07,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,824 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:39:07,826 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:39:07,827 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:39:07,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,837 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:07,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,840 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:07,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,844 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:07,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:07,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,852 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:39:07,853 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:39:07,855 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:39:07,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:07,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:07,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:07,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:07,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:07,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:07,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:07,881 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:07,882 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:07,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:07,884 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:39:07,885 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:39:07,886 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:07,902 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:39:07,903 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:07,903 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:07,903 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork3_j, N) = -1*thread2Thread1of1ForFork3_j + 1*N Supporting invariants [] [2025-04-26 18:39:07,909 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:39:07,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:07,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:07,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:07,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:07,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:07,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:07,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:07,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:07,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:07,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:07,983 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:39:07,984 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:39:07,984 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7958 states and 18446 transitions. cyclomatic complexity: 10863 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:39:08,226 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7958 states and 18446 transitions. cyclomatic complexity: 10863. 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) Result 17149 states and 38972 transitions. Complement of second has 6 states. [2025-04-26 18:39:08,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. 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:39:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-04-26 18:39:08,227 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:39:08,227 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:08,227 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:39:08,227 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:08,228 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 18:39:08,228 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:08,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17149 states and 38972 transitions. [2025-04-26 18:39:08,344 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 741 [2025-04-26 18:39:08,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17149 states to 12447 states and 27954 transitions. [2025-04-26 18:39:08,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3758 [2025-04-26 18:39:08,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4142 [2025-04-26 18:39:08,432 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12447 states and 27954 transitions. [2025-04-26 18:39:08,432 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:08,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12447 states and 27954 transitions. [2025-04-26 18:39:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states and 27954 transitions. [2025-04-26 18:39:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12087. [2025-04-26 18:39:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12087 states, 12087 states have (on average 2.2548192272689667) internal successors, (in total 27254), 12086 states have internal predecessors, (27254), 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:39:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12087 states to 12087 states and 27254 transitions. [2025-04-26 18:39:08,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12087 states and 27254 transitions. [2025-04-26 18:39:08,687 INFO L438 stractBuchiCegarLoop]: Abstraction has 12087 states and 27254 transitions. [2025-04-26 18:39:08,687 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:08,687 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12087 states and 27254 transitions. [2025-04-26 18:39:08,733 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 741 [2025-04-26 18:39:08,734 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:08,734 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:08,734 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:39:08,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:08,735 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[104] L69-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork3_j_3) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[106] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 18:39:08,735 INFO L754 eck$LassoCheckResult]: Loop: "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[119] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork4_k_9 1) v_thread3Thread1of1ForFork4_k_10) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_9} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 18:39:08,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2047157030, now seen corresponding path program 1 times [2025-04-26 18:39:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824023080] [2025-04-26 18:39:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:08,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:08,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:39:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:08,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824023080] [2025-04-26 18:39:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824023080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625590817] [2025-04-26 18:39:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:08,809 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:08,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 145044, now seen corresponding path program 1 times [2025-04-26 18:39:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:08,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695570856] [2025-04-26 18:39:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:08,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:08,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:08,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:08,838 INFO L87 Difference]: Start difference. First operand 12087 states and 27254 transitions. cyclomatic complexity: 15651 Second operand has 4 states, 4 states have (on average 3.75) 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:39:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:09,007 INFO L93 Difference]: Finished difference Result 21050 states and 47003 transitions. [2025-04-26 18:39:09,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21050 states and 47003 transitions. [2025-04-26 18:39:09,134 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 828 [2025-04-26 18:39:09,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21050 states to 21050 states and 47003 transitions. [2025-04-26 18:39:09,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6225 [2025-04-26 18:39:09,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6225 [2025-04-26 18:39:09,287 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21050 states and 47003 transitions. [2025-04-26 18:39:09,287 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:09,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21050 states and 47003 transitions. [2025-04-26 18:39:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21050 states and 47003 transitions. [2025-04-26 18:39:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21050 to 13013. [2025-04-26 18:39:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13013 states, 13013 states have (on average 2.240451855836471) internal successors, (in total 29155), 13012 states have internal predecessors, (29155), 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:39:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13013 states to 13013 states and 29155 transitions. [2025-04-26 18:39:09,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13013 states and 29155 transitions. [2025-04-26 18:39:09,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:09,711 INFO L438 stractBuchiCegarLoop]: Abstraction has 13013 states and 29155 transitions. [2025-04-26 18:39:09,711 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:09,711 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13013 states and 29155 transitions. [2025-04-26 18:39:09,742 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 741 [2025-04-26 18:39:09,742 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:09,742 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:09,743 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:39:09,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:09,743 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 18:39:09,743 INFO L754 eck$LassoCheckResult]: Loop: "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[119] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork4_k_9 1) v_thread3Thread1of1ForFork4_k_10) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_9} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" [2025-04-26 18:39:09,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2047125317, now seen corresponding path program 1 times [2025-04-26 18:39:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:09,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271235048] [2025-04-26 18:39:09,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:09,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:09,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:09,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:09,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:09,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:09,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 145044, now seen corresponding path program 2 times [2025-04-26 18:39:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:09,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368823724] [2025-04-26 18:39:09,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:09,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:09,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:09,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:09,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:09,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:09,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:09,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1669567590, now seen corresponding path program 1 times [2025-04-26 18:39:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:09,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457531203] [2025-04-26 18:39:09,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:09,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:09,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:09,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:09,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:09,922 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:09,922 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:09,922 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:09,922 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:09,922 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:09,923 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:09,923 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:09,923 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:09,923 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:39:09,923 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:09,923 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:09,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:09,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:10,057 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:10,057 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:10,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,059 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:39:10,060 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:39:10,061 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:39:10,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,076 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,081 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:39:10,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,083 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:39:10,084 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:39:10,084 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:39:10,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,102 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:39:10,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,109 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:39:10,110 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:39:10,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:10,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,125 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:39:10,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,133 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:39:10,134 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:39:10,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:10,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:39:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,191 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:39:10,193 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:39:10,194 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:39:10,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,209 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,216 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:39:10,217 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:39:10,219 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:39:10,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,233 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,241 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:39:10,305 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:39:10,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:10,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:39:10,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,330 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:39:10,332 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:39:10,333 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:39:10,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,346 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,352 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:39:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,355 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:39:10,356 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:39:10,358 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:39:10,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,372 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,381 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:39:10,382 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:39:10,383 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:39:10,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:10,403 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:39:10,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,405 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:39:10,407 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:39:10,408 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:39:10,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:10,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:10,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:10,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:10,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:10,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:10,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:10,432 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:10,433 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:10,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:10,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:10,434 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:39:10,436 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:39:10,437 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:10,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:10,454 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:10,454 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:10,454 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork4_k, N) = -1*thread3Thread1of1ForFork4_k + 1*N Supporting invariants [] [2025-04-26 18:39:10,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:39:10,460 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:10,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:10,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:10,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:10,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:10,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:10,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:10,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:10,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:10,512 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:39:10,513 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:39:10,513 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13013 states and 29155 transitions. cyclomatic complexity: 16658 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:10,672 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13013 states and 29155 transitions. cyclomatic complexity: 16658. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 28054 states and 61461 transitions. Complement of second has 6 states. [2025-04-26 18:39:10,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-26 18:39:10,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 18:39:10,673 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:10,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:10,673 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:10,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 18:39:10,674 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:10,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28054 states and 61461 transitions. [2025-04-26 18:39:10,810 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 454 [2025-04-26 18:39:10,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28054 states to 19710 states and 42587 transitions. [2025-04-26 18:39:10,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5027 [2025-04-26 18:39:10,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5313 [2025-04-26 18:39:10,928 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19710 states and 42587 transitions. [2025-04-26 18:39:10,929 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:10,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19710 states and 42587 transitions. [2025-04-26 18:39:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19710 states and 42587 transitions. [2025-04-26 18:39:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19710 to 19216. [2025-04-26 18:39:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19216 states, 19216 states have (on average 2.1785491257285594) internal successors, (in total 41863), 19215 states have internal predecessors, (41863), 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:39:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19216 states to 19216 states and 41863 transitions. [2025-04-26 18:39:11,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19216 states and 41863 transitions. [2025-04-26 18:39:11,298 INFO L438 stractBuchiCegarLoop]: Abstraction has 19216 states and 41863 transitions. [2025-04-26 18:39:11,298 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:11,298 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19216 states and 41863 transitions. [2025-04-26 18:39:11,445 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 454 [2025-04-26 18:39:11,446 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,446 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:11,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:11,448 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:11,448 INFO L754 eck$LassoCheckResult]: Loop: "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[125] L89-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 18:39:11,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1669567093, now seen corresponding path program 1 times [2025-04-26 18:39:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653177647] [2025-04-26 18:39:11,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash 151002, now seen corresponding path program 1 times [2025-04-26 18:39:11,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992800172] [2025-04-26 18:39:11,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1943108624, now seen corresponding path program 1 times [2025-04-26 18:39:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93315470] [2025-04-26 18:39:11,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:11,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:11,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:11,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,896 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:11,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,896 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,091 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:12,091 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,093 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:39:12,095 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:39:12,096 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:39:12,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,119 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:39:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,122 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:39:12,123 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:39:12,124 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:39:12,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,138 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,144 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:39:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,146 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:39:12,148 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:39:12,149 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:39:12,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,163 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,171 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:39:12,172 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:39:12,174 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:39:12,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,188 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,193 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:39:12,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,198 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:39:12,199 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:39:12,200 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:39:12,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,221 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:39:12,222 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:39:12,223 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:39:12,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,242 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,248 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:39:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,251 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:39:12,255 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:39:12,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,268 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,275 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:39:12,277 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:39:12,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,290 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:39:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,298 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:39:12,299 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:39:12,300 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:39:12,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,314 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,319 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:39:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,321 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:39:12,322 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:39:12,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:12,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,336 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:39:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,344 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:39:12,345 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:39:12,346 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:39:12,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,359 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,364 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:39:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,366 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:39:12,367 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:39:12,369 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:39:12,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,382 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:12,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,389 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:39:12,390 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:39:12,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:12,412 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:12,412 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:39:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,414 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:39:12,415 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:12,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 18:39:12,431 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:12,431 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:12,431 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:12,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:39:12,437 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:12,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:12,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,494 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:39:12,495 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:39:12,495 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19216 states and 41863 transitions. cyclomatic complexity: 23381 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:39:12,763 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19216 states and 41863 transitions. cyclomatic complexity: 23381. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 40299 states and 86261 transitions. Complement of second has 6 states. [2025-04-26 18:39:12,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:39:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-26 18:39:12,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:12,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 18:39:12,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,765 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 18:39:12,765 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40299 states and 86261 transitions. [2025-04-26 18:39:13,083 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 198 [2025-04-26 18:39:13,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40299 states to 24504 states and 51499 transitions. [2025-04-26 18:39:13,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5649 [2025-04-26 18:39:13,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5842 [2025-04-26 18:39:13,236 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24504 states and 51499 transitions. [2025-04-26 18:39:13,236 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:13,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24504 states and 51499 transitions. [2025-04-26 18:39:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24504 states and 51499 transitions. [2025-04-26 18:39:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24504 to 23986. [2025-04-26 18:39:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23986 states, 23986 states have (on average 2.117151671808555) internal successors, (in total 50782), 23985 states have internal predecessors, (50782), 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:39:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23986 states to 23986 states and 50782 transitions. [2025-04-26 18:39:13,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23986 states and 50782 transitions. [2025-04-26 18:39:13,583 INFO L438 stractBuchiCegarLoop]: Abstraction has 23986 states and 50782 transitions. [2025-04-26 18:39:13,583 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:13,583 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23986 states and 50782 transitions. [2025-04-26 18:39:13,655 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 198 [2025-04-26 18:39:13,655 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:13,655 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:13,655 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, 1, 1, 1] [2025-04-26 18:39:13,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:13,656 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[147] thread1EXIT-->L39: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_4) InVars {thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:39:13,656 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:13,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -982993737, now seen corresponding path program 1 times [2025-04-26 18:39:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020271179] [2025-04-26 18:39:13,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:13,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:13,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:13,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:13,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 1 times [2025-04-26 18:39:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320384754] [2025-04-26 18:39:13,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1279265720, now seen corresponding path program 1 times [2025-04-26 18:39:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105101375] [2025-04-26 18:39:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:13,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:13,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:13,753 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:39:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:13,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105101375] [2025-04-26 18:39:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105101375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:39:13,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023978574] [2025-04-26 18:39:13,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:13,755 INFO L229 MonitoredProcess]: Starting monitored process 39 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:39:13,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-26 18:39:13,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:13,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:13,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:39:13,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:13,830 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:39:13,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:39:13,867 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:39:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023978574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:39:13,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:39:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 18:39:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968271837] [2025-04-26 18:39:13,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:39:13,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:13,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 18:39:13,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 18:39:13,880 INFO L87 Difference]: Start difference. First operand 23986 states and 50782 transitions. cyclomatic complexity: 27720 Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (in total 37), 10 states have internal predecessors, (37), 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:39:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:14,093 INFO L93 Difference]: Finished difference Result 24939 states and 52217 transitions. [2025-04-26 18:39:14,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24939 states and 52217 transitions. [2025-04-26 18:39:14,364 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 198 [2025-04-26 18:39:14,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24939 states to 24004 states and 50806 transitions. [2025-04-26 18:39:14,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5646 [2025-04-26 18:39:14,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5646 [2025-04-26 18:39:14,488 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24004 states and 50806 transitions. [2025-04-26 18:39:14,488 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:14,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24004 states and 50806 transitions. [2025-04-26 18:39:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24004 states and 50806 transitions. [2025-04-26 18:39:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24004 to 23992. [2025-04-26 18:39:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23992 states, 23992 states have (on average 2.1169139713237746) internal successors, (in total 50789), 23991 states have internal predecessors, (50789), 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:39:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23992 states to 23992 states and 50789 transitions. [2025-04-26 18:39:14,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23992 states and 50789 transitions. [2025-04-26 18:39:14,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:39:14,796 INFO L438 stractBuchiCegarLoop]: Abstraction has 23992 states and 50789 transitions. [2025-04-26 18:39:14,796 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:14,796 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23992 states and 50789 transitions. [2025-04-26 18:39:14,866 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 198 [2025-04-26 18:39:14,867 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:14,867 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:14,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:14,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:14,868 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[147] thread1EXIT-->L39: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_4) InVars {thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 18:39:14,868 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:14,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -3961760, now seen corresponding path program 2 times [2025-04-26 18:39:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146067498] [2025-04-26 18:39:14,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 18:39:14,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:14,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:14,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:14,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:14,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 2 times [2025-04-26 18:39:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485494436] [2025-04-26 18:39:14,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:14,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2060546049, now seen corresponding path program 2 times [2025-04-26 18:39:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320724855] [2025-04-26 18:39:14,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 18:39:14,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:39:14,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:14,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:39:14,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:39:14,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,396 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:15,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:15,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:15,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:15,396 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:15,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:15,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:15,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:39:15,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:15,396 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:15,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:15,746 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:15,746 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,750 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:39:15,751 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:39:15,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,768 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 18:39:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,775 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:39:15,777 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:39:15,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,787 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:15,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:15,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,792 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:39:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,799 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:39:15,801 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:39:15,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,815 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:39:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,822 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:39:15,824 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:39:15,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,837 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 18:39:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,843 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:39:15,845 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:39:15,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:15,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,864 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:39:15,866 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:39:15,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:39:15,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,884 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:39:15,886 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:39:15,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,899 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:15,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,906 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:39:15,907 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:39:15,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,920 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 18:39:15,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,928 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:39:15,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:15,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:39:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,950 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:39:15,952 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:39:15,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:39:15,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,971 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:39:15,973 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:39:15,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:15,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:15,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:15,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:15,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:15,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:15,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:15,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 18:39:15,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:15,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:15,993 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:39:15,995 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:39:16,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:39:16,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,016 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:39:16,018 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:39:16,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:39:16,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,038 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:39:16,040 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:39:16,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,055 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 18:39:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,064 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:39:16,065 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:39:16,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 18:39:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,086 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:39:16,088 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:39:16,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,101 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 18:39:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,124 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 18:39:16,126 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:39:16,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 18:39:16,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,146 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 18:39:16,148 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:39:16,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,161 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 18:39:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,169 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 18:39:16,171 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:39:16,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:16,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:16,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:16,183 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:16,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 18:39:16,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,190 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 18:39:16,192 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:39:16,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:16,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:16,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:16,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:16,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:16,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:16,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:16,214 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:39:16,214 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:16,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:16,216 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:16,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 18:39:16,218 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:16,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 18:39:16,233 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:16,233 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:16,233 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 18:39:16,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 18:39:16,239 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:16,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:16,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:16,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:16,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:16,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:16,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:16,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:16,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:16,291 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:39:16,291 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:39:16,291 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23992 states and 50789 transitions. cyclomatic complexity: 27721 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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:39:16,419 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23992 states and 50789 transitions. cyclomatic complexity: 27721. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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 24898 states and 52398 transitions. Complement of second has 6 states. [2025-04-26 18:39:16,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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:39:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 18:39:16,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 18:39:16,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:16,421 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 18:39:16,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:16,421 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 26 letters. Loop has 6 letters. [2025-04-26 18:39:16,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:16,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24898 states and 52398 transitions. [2025-04-26 18:39:16,626 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:16,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24898 states to 20342 states and 42454 transitions. [2025-04-26 18:39:16,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4281 [2025-04-26 18:39:16,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4342 [2025-04-26 18:39:16,749 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20342 states and 42454 transitions. [2025-04-26 18:39:16,749 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:16,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20342 states and 42454 transitions. [2025-04-26 18:39:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20342 states and 42454 transitions. [2025-04-26 18:39:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20342 to 19958. [2025-04-26 18:39:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19958 states, 19958 states have (on average 2.1079266459565087) internal successors, (in total 42070), 19957 states have internal predecessors, (42070), 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:39:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 42070 transitions. [2025-04-26 18:39:17,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19958 states and 42070 transitions. [2025-04-26 18:39:17,046 INFO L438 stractBuchiCegarLoop]: Abstraction has 19958 states and 42070 transitions. [2025-04-26 18:39:17,046 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:39:17,046 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19958 states and 42070 transitions. [2025-04-26 18:39:17,099 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:17,099 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:17,099 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:17,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:17,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:17,101 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[115] L87-1-->thread3FINAL: Formula: (<= v_N_6 v_thread3Thread1of1ForFork4_k_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_3, N=v_N_6} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_3, N=v_N_6} AuxVars[] AssignedVars[]" [2025-04-26 18:39:17,101 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:17,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1811803956, now seen corresponding path program 1 times [2025-04-26 18:39:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:17,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354231129] [2025-04-26 18:39:17,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:39:17,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:39:17,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:17,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:17,172 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:39:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:17,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354231129] [2025-04-26 18:39:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354231129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:39:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180606942] [2025-04-26 18:39:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:17,172 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:17,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 3 times [2025-04-26 18:39:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:17,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331603012] [2025-04-26 18:39:17,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:17,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:17,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:17,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:17,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:17,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:17,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:17,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:17,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:17,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:17,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:17,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:17,198 INFO L87 Difference]: Start difference. First operand 19958 states and 42070 transitions. cyclomatic complexity: 22838 Second operand has 4 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:17,349 INFO L93 Difference]: Finished difference Result 34760 states and 73079 transitions. [2025-04-26 18:39:17,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34760 states and 73079 transitions. [2025-04-26 18:39:17,636 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 144 [2025-04-26 18:39:17,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34760 states to 34734 states and 73022 transitions. [2025-04-26 18:39:17,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7282 [2025-04-26 18:39:17,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7285 [2025-04-26 18:39:17,828 INFO L74 IsDeterministic]: Start isDeterministic. Operand 34734 states and 73022 transitions. [2025-04-26 18:39:17,828 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:17,828 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34734 states and 73022 transitions. [2025-04-26 18:39:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34734 states and 73022 transitions. [2025-04-26 18:39:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34734 to 22396. [2025-04-26 18:39:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22396 states, 22396 states have (on average 2.1136363636363638) internal successors, (in total 47337), 22395 states have internal predecessors, (47337), 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:39:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22396 states to 22396 states and 47337 transitions. [2025-04-26 18:39:18,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22396 states and 47337 transitions. [2025-04-26 18:39:18,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:18,174 INFO L438 stractBuchiCegarLoop]: Abstraction has 22396 states and 47337 transitions. [2025-04-26 18:39:18,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:39:18,174 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22396 states and 47337 transitions. [2025-04-26 18:39:18,239 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:18,239 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:18,239 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:18,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:18,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:18,240 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:18,241 INFO L754 eck$LassoCheckResult]: Loop: "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:18,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1811803955, now seen corresponding path program 1 times [2025-04-26 18:39:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874166701] [2025-04-26 18:39:18,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:39:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:39:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:18,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:39:18,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:39:18,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:18,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 158910, now seen corresponding path program 4 times [2025-04-26 18:39:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694050339] [2025-04-26 18:39:18,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:39:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-04-26 18:39:18,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:18,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:39:18,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:18,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:18,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:18,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:18,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -597485454, now seen corresponding path program 1 times [2025-04-26 18:39:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602736173] [2025-04-26 18:39:18,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:39:18,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:39:18,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:39:18,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:39:18,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:18,893 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:18,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:18,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:18,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:18,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:18,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:18,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:18,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:18,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:39:18,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:18,893 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:18,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:18,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,737 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:20,737 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,739 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:20,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:39:20,742 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:39:20,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,755 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 18:39:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,762 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:39:20,764 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:39:20,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 18:39:20,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,784 INFO L229 MonitoredProcess]: Starting monitored process 63 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:39:20,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 18:39:20,785 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:39:20,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,798 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 18:39:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,805 INFO L229 MonitoredProcess]: Starting monitored process 64 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:39:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 18:39:20,808 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:39:20,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:20,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,827 INFO L229 MonitoredProcess]: Starting monitored process 65 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:39:20,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 18:39:20,829 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:39:20,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,841 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 18:39:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,848 INFO L229 MonitoredProcess]: Starting monitored process 66 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:39:20,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 18:39:20,849 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:39:20,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,862 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 18:39:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,868 INFO L229 MonitoredProcess]: Starting monitored process 67 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:39:20,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 18:39:20,870 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:39:20,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,882 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 18:39:20,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,889 INFO L229 MonitoredProcess]: Starting monitored process 68 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:39:20,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 18:39:20,891 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:39:20,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,903 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 18:39:20,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,910 INFO L229 MonitoredProcess]: Starting monitored process 69 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:39:20,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 18:39:20,913 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:39:20,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,925 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 18:39:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,932 INFO L229 MonitoredProcess]: Starting monitored process 70 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:39:20,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 18:39:20,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:20,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,951 INFO L229 MonitoredProcess]: Starting monitored process 71 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:39:20,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 18:39:20,953 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:39:20,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,965 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,971 INFO L229 MonitoredProcess]: Starting monitored process 72 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:39:20,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 18:39:20,973 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:39:20,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,985 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 18:39:20,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,992 INFO L229 MonitoredProcess]: Starting monitored process 73 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:39:20,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 18:39:20,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:21,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:21,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:21,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:21,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:21,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:21,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:21,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:21,004 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:21,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 18:39:21,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:21,011 INFO L229 MonitoredProcess]: Starting monitored process 74 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:39:21,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 18:39:21,012 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:39:21,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:21,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:21,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:21,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:21,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:21,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:21,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:21,035 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:39:21,035 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:21,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:21,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:21,037 INFO L229 MonitoredProcess]: Starting monitored process 75 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:39:21,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 18:39:21,039 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:21,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 18:39:21,054 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:21,054 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:21,054 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 18:39:21,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:21,063 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:21,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:21,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:39:21,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:39:21,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:21,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:21,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:21,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:21,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:21,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:21,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:21,115 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:39:21,115 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:39:21,115 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22396 states and 47337 transitions. cyclomatic complexity: 25772 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:21,458 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22396 states and 47337 transitions. cyclomatic complexity: 25772. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 69718 states and 147204 transitions. Complement of second has 7 states. [2025-04-26 18:39:21,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-26 18:39:21,459 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 27 letters. Loop has 3 letters. [2025-04-26 18:39:21,459 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,459 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 30 letters. Loop has 3 letters. [2025-04-26 18:39:21,460 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,460 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 27 letters. Loop has 6 letters. [2025-04-26 18:39:21,460 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69718 states and 147204 transitions. [2025-04-26 18:39:21,948 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:22,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69718 states to 21606 states and 44931 transitions. [2025-04-26 18:39:22,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4522 [2025-04-26 18:39:22,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4543 [2025-04-26 18:39:22,062 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21606 states and 44931 transitions. [2025-04-26 18:39:22,062 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:22,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21606 states and 44931 transitions. [2025-04-26 18:39:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states and 44931 transitions. [2025-04-26 18:39:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 20997. [2025-04-26 18:39:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20997 states, 20997 states have (on average 2.1073486688574556) internal successors, (in total 44248), 20996 states have internal predecessors, (44248), 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:39:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20997 states to 20997 states and 44248 transitions. [2025-04-26 18:39:22,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20997 states and 44248 transitions. [2025-04-26 18:39:22,379 INFO L438 stractBuchiCegarLoop]: Abstraction has 20997 states and 44248 transitions. [2025-04-26 18:39:22,379 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:39:22,379 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20997 states and 44248 transitions. [2025-04-26 18:39:22,452 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:22,452 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:22,452 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:22,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:22,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:22,453 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[99] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[121] L87-1-->thread3FINAL: Formula: (<= v_N_6 v_thread3Thread1of1ForFork0_k_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_3, N=v_N_6} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_3, N=v_N_6} AuxVars[] AssignedVars[]" "[123] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[104] L69-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork3_j_3) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 18:39:22,453 INFO L754 eck$LassoCheckResult]: Loop: "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 18:39:22,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -814932489, now seen corresponding path program 1 times [2025-04-26 18:39:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833453752] [2025-04-26 18:39:22,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:39:22,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-26 18:39:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:22,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833453752] [2025-04-26 18:39:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833453752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399746080] [2025-04-26 18:39:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:22,499 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:22,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 156960, now seen corresponding path program 5 times [2025-04-26 18:39:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908430649] [2025-04-26 18:39:22,499 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:39:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:22,502 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:22,502 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:22,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:22,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:22,518 INFO L87 Difference]: Start difference. First operand 20997 states and 44248 transitions. cyclomatic complexity: 24084 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (in total 25), 3 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:39:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:22,720 INFO L93 Difference]: Finished difference Result 36650 states and 77336 transitions. [2025-04-26 18:39:22,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36650 states and 77336 transitions. [2025-04-26 18:39:22,924 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 150 [2025-04-26 18:39:23,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36650 states to 36558 states and 77124 transitions. [2025-04-26 18:39:23,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7554 [2025-04-26 18:39:23,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7566 [2025-04-26 18:39:23,247 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36558 states and 77124 transitions. [2025-04-26 18:39:23,247 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:23,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36558 states and 77124 transitions. [2025-04-26 18:39:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36558 states and 77124 transitions. [2025-04-26 18:39:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36558 to 22771. [2025-04-26 18:39:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22771 states, 22771 states have (on average 2.1213824601466778) internal successors, (in total 48306), 22770 states have internal predecessors, (48306), 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:39:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22771 states to 22771 states and 48306 transitions. [2025-04-26 18:39:23,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22771 states and 48306 transitions. [2025-04-26 18:39:23,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:23,587 INFO L438 stractBuchiCegarLoop]: Abstraction has 22771 states and 48306 transitions. [2025-04-26 18:39:23,587 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:39:23,588 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22771 states and 48306 transitions. [2025-04-26 18:39:23,651 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:23,651 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:23,651 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:23,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:23,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:23,652 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[111] L70-2-->L73-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork3_j_13) 0) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[113] L73-1-->L69-1: Formula: (= (+ v_thread2Thread1of1ForFork3_j_15 1) v_thread2Thread1of1ForFork3_j_16) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_15} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[104] L69-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork3_j_3) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[118] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork4_k_7 v_thread3Thread1of1ForFork4_k_7) v_B_3) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[124] L88-->L89: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 18:39:23,652 INFO L754 eck$LassoCheckResult]: Loop: "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 18:39:23,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash -366776668, now seen corresponding path program 1 times [2025-04-26 18:39:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:23,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197264974] [2025-04-26 18:39:23,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:39:23,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:23,699 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:39:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:23,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197264974] [2025-04-26 18:39:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197264974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:39:23,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722426002] [2025-04-26 18:39:23,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:23,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:39:23,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,702 INFO L229 MonitoredProcess]: Starting monitored process 76 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:39:23,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-26 18:39:23,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:39:23,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:39:23,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:23,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:39:23,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:23,772 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:39:23,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:39:23,811 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:39:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722426002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:39:23,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:39:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-26 18:39:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517061398] [2025-04-26 18:39:23,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:39:23,811 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:23,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 156960, now seen corresponding path program 6 times [2025-04-26 18:39:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:23,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898839704] [2025-04-26 18:39:23,812 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 18:39:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:23,814 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:23,815 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:23,815 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 18:39:23,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:23,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:23,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:23,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:23,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 18:39:23,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-26 18:39:23,829 INFO L87 Difference]: Start difference. First operand 22771 states and 48306 transitions. cyclomatic complexity: 26441 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (in total 39), 10 states have internal predecessors, (39), 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:39:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:24,152 INFO L93 Difference]: Finished difference Result 52347 states and 110734 transitions. [2025-04-26 18:39:24,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52347 states and 110734 transitions. [2025-04-26 18:39:24,456 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 138 [2025-04-26 18:39:24,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52347 states to 51204 states and 108409 transitions. [2025-04-26 18:39:24,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9743 [2025-04-26 18:39:24,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9743 [2025-04-26 18:39:24,741 INFO L74 IsDeterministic]: Start isDeterministic. Operand 51204 states and 108409 transitions. [2025-04-26 18:39:24,741 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:24,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51204 states and 108409 transitions. [2025-04-26 18:39:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51204 states and 108409 transitions. [2025-04-26 18:39:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51204 to 33219. [2025-04-26 18:39:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33219 states, 33219 states have (on average 2.1320629760077066) internal successors, (in total 70825), 33218 states have internal predecessors, (70825), 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:39:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33219 states to 33219 states and 70825 transitions. [2025-04-26 18:39:25,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33219 states and 70825 transitions. [2025-04-26 18:39:25,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:39:25,531 INFO L438 stractBuchiCegarLoop]: Abstraction has 33219 states and 70825 transitions. [2025-04-26 18:39:25,531 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:39:25,531 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33219 states and 70825 transitions. [2025-04-26 18:39:25,611 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 108 [2025-04-26 18:39:25,611 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:25,611 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:25,612 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:25,612 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:25,612 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[140] L34-->$Ultimate##0: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_i]" "[96] $Ultimate##0-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[143] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_20, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_cnt]" "[102] $Ultimate##0-->L68: Formula: (= v_thread2Thread1of1ForFork3_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_cnt=v_thread2Thread1of1ForFork3_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_cnt]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[146] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_14, thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k, thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[114] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork4_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_k]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[116] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork4_k_5 v_N_5) InVars {thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork4_k=v_thread3Thread1of1ForFork4_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[134] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[120] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[98] L55-1-->L56: Formula: (< v_thread1Thread1of1ForFork2_i_5 v_N_1) InVars {N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} OutVars{N=v_N_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[103] L68-->L69-1: Formula: (= v_thread2Thread1of1ForFork3_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_j]" "[100] L56-->L57: Formula: (= v_A_1 (store v_A_2 v_thread1Thread1of1ForFork2_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork2_i_7))) (ite (< .cse0 0) 0 .cse0)))) InVars {A=v_A_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_7} AuxVars[] AssignedVars[A]" "[101] L57-->L55-1: Formula: (= v_thread1Thread1of1ForFork2_i_10 (+ v_thread1Thread1of1ForFork2_i_9 1)) InVars {thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_9} OutVars{thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_i]" "[137] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[126] $Ultimate##0-->L87-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[97] L55-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork2_i_3) InVars {N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} OutVars{N=v_N_2, thread1Thread1of1ForFork2_i=v_thread1Thread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[105] L69-1-->L70: Formula: (< v_thread2Thread1of1ForFork3_j_5 v_N_4) InVars {thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[108] L70-->L70-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork3_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork3_j=v_thread2Thread1of1ForFork3_j_9} AuxVars[] AssignedVars[]" "[122] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:25,612 INFO L754 eck$LassoCheckResult]: Loop: "[128] L87-1-->L88: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[130] L88-->L89: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[131] L89-->L87-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 18:39:25,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 768466514, now seen corresponding path program 1 times [2025-04-26 18:39:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483881883] [2025-04-26 18:39:25,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:39:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:39:25,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:39:25,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:39:25,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:25,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 156960, now seen corresponding path program 7 times [2025-04-26 18:39:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477403972] [2025-04-26 18:39:25,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 18:39:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:25,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:25,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:25,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:25,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1210358063, now seen corresponding path program 2 times [2025-04-26 18:39:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226699152] [2025-04-26 18:39:25,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:39:25,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:39:25,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:39:25,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:39:25,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:26,556 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:26,557 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:26,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:26,557 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:26,557 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:26,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:26,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:26,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:26,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-3modifiers.bpl_petrified1_Iteration13_Lasso [2025-04-26 18:39:26,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:26,557 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:26,660 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 66307 disjunctions. This might take some time... Received shutdown request... [2025-04-26 18:43:42,574 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:43:42,575 INFO L201 PluginConnector]: Adding new model map-aggr-update1-3modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:43:42 BoogieIcfgContainer [2025-04-26 18:43:42,575 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:43:42,575 INFO L158 Benchmark]: Toolchain (without parser) took 280024.84ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 84.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-26 18:43:42,576 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:42,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.54ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:42,576 INFO L158 Benchmark]: Boogie Preprocessor took 20.78ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 80.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:42,576 INFO L158 Benchmark]: RCFGBuilder took 196.04ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 70.8MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:43:42,576 INFO L158 Benchmark]: BuchiAutomizer took 279764.19ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 70.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-26 18:43:42,578 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.19ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.54ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.78ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 80.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 196.04ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 70.8MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 279764.19ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 70.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 279.6s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 264.9s. Construction of modules took 0.4s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 12. Automata minimization 4.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 55802 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 4.3s Buchi closure took 0.1s. 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, 1257 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1251 mSDsluCounter, 1166 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 615 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 551 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU5 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital140 mio100 ax100 hnf100 lsp1100 ukn31 mio100 lsp112 div100 bol100 ite100 ukn100 eq147 hnf97 smp77 dnf247 smp69 tf101 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 3 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 1.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 1739, Number of transitions in reduction automaton: 15583, Number of states in reduction automaton: 6840, Underlying: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiAutomatonCegarLoop was analyzing lasso (stem: length 30 TraceHistMax 4 loop: length 4 TraceHistMax 1),while LassoBuilder was applying LassoPartitioneer to lasso for termination ,while CnfTransformerHelper was XNF transformer was simplifying 66307 disjunctions. . [2025-04-26 18:43:42,582 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 18:43:42,582 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-26 18:43:42,582 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown