/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:26,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:26,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:26,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:26,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:26,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:26,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:26,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:26,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:26,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:26,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:26,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:26,267 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:26,267 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:26,268 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:26,268 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:26,268 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:26,268 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:26,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:26,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:26,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:26,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:26,270 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:26,270 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:26,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:26,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:26,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:26,477 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:26,478 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:26,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl [2025-04-26 18:41:26,479 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl' [2025-04-26 18:41:26,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:26,501 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:26,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:26,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:26,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:26,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,533 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:26,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:26,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:26,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:26,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:26,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:26,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:26,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:26,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:26,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/1) ... [2025-04-26 18:41:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:26,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:26,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:26,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:26,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:26,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:26,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:26,610 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:26,647 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:26,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:26,726 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:26,726 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:26,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:26,749 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:26,750 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:26 BoogieIcfgContainer [2025-04-26 18:41:26,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:26,751 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:26,751 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:26,758 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:26,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:26,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:26" (1/2) ... [2025-04-26 18:41:26,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a76d89b and model type counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:26, skipping insertion in model container [2025-04-26 18:41:26,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:26,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:26" (2/2) ... [2025-04-26 18:41:26,761 INFO L376 chiAutomizerObserver]: Analyzing ICFG counter-add-4-semi-Q67.wvr.bpl [2025-04-26 18:41:26,805 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:26,835 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:26,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:26,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:26,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:26,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:41:26,902 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 18:41:26,905 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:26,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 18:41:26,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:41:26,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:26,912 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:26,912 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:26,968 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 433 states, 431 states have (on average 3.8445475638051043) internal successors, (in total 1657), 432 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,969 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 433 states, 431 states have (on average 3.8445475638051043) internal successors, (in total 1657), 432 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:26,971 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:27,182 WARN L140 AmpleReduction]: Number of pruned transitions: 553 [2025-04-26 18:41:27,182 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:27,182 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 172 [2025-04-26 18:41:27,183 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:41:27,184 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:224 [2025-04-26 18:41:27,184 WARN L145 AmpleReduction]: Times succ was already a loop node:336 [2025-04-26 18:41:27,184 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:37 [2025-04-26 18:41:27,184 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:27,185 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 424 states, 422 states have (on average 2.509478672985782) internal successors, (in total 1059), 423 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:27,193 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:27,194 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:27,194 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:27,194 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:27,194 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:27,194 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:27,195 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:27,195 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:27,197 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 424 states, 422 states have (on average 2.509478672985782) internal successors, (in total 1059), 423 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:27,226 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 366 [2025-04-26 18:41:27,226 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:27,226 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:27,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:41:27,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:27,232 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:27,233 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 424 states, 422 states have (on average 2.509478672985782) internal successors, (in total 1059), 423 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:27,242 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 366 [2025-04-26 18:41:27,242 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:27,242 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:27,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:41:27,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:27,246 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:27,247 INFO L754 eck$LassoCheckResult]: Loop: "[87] L23-1-->L23: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[89] L23-->L23-1: Formula: (and (= v_counter_13 (+ v_counter_14 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_14} OutVars{i1=v_i1_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 18:41:27,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 3162445, now seen corresponding path program 1 times [2025-04-26 18:41:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:27,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928088774] [2025-04-26 18:41:27,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:27,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:27,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:27,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:27,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:27,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 18:41:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:27,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120636474] [2025-04-26 18:41:27,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:27,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:27,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:27,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:27,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:27,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:27,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1255854865, now seen corresponding path program 1 times [2025-04-26 18:41:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:27,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220923621] [2025-04-26 18:41:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:27,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:27,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:27,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:27,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:27,432 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:27,433 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:27,433 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:27,435 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:27,435 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:27,435 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,435 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:27,435 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:27,435 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:27,435 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:27,435 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:27,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,543 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:27,543 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:27,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:27,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:27,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:27,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:27,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:27,608 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:27,608 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [{counter=2}, {counter=-6}, {counter=5}] Lambdas: [4, 1, 1] Nus: [1, 0] [2025-04-26 18:41:27,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:27,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:27,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:27,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:27,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:27,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:27,707 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:27,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:27,712 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:27,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:27,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:27,712 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:27,712 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:27,712 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,712 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:27,713 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:27,713 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:27,713 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:27,713 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:27,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:27,752 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:27,755 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:27,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:27,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:27,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:27,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:27,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:27,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:27,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:27,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:27,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:27,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:27,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:27,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:27,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:27,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:27,809 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:27,809 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:27,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:27,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:27,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:27,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:27,831 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:27,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:27,834 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:27,834 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:27,834 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 18:41:27,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:27,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:27,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:27,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:27,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:27,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:27,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:27,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:27,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:27,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:27,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:27,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:27,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:27,921 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:27,923 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 424 states, 422 states have (on average 2.509478672985782) internal successors, (in total 1059), 423 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,045 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 424 states, 422 states have (on average 2.509478672985782) internal successors, (in total 1059), 423 states have internal predecessors, (1059), 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 1008 states and 2520 transitions. Complement of second has 7 states. [2025-04-26 18:41:28,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-26 18:41:28,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:41:28,057 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:41:28,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:41:28,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1008 states and 2520 transitions. [2025-04-26 18:41:28,075 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 18:41:28,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1008 states to 525 states and 1304 transitions. [2025-04-26 18:41:28,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2025-04-26 18:41:28,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2025-04-26 18:41:28,091 INFO L74 IsDeterministic]: Start isDeterministic. Operand 525 states and 1304 transitions. [2025-04-26 18:41:28,091 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:28,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 525 states and 1304 transitions. [2025-04-26 18:41:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 1304 transitions. [2025-04-26 18:41:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 450. [2025-04-26 18:41:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 450 states have (on average 2.502222222222222) internal successors, (in total 1126), 449 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1126 transitions. [2025-04-26 18:41:28,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 450 states and 1126 transitions. [2025-04-26 18:41:28,143 INFO L438 stractBuchiCegarLoop]: Abstraction has 450 states and 1126 transitions. [2025-04-26 18:41:28,143 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:28,144 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 1126 transitions. [2025-04-26 18:41:28,146 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 18:41:28,146 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:28,146 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:28,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:28,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:28,147 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L23-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[88] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:28,147 INFO L754 eck$LassoCheckResult]: Loop: "[91] L34-1-->L34: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[93] L34-->L34-1: Formula: (and (= v_counter_22 (+ v_counter_21 1)) (< 0 v_counter_22) (= v_i2_10 (+ v_i2_11 1))) InVars {i2=v_i2_11, counter=v_counter_22} OutVars{i2=v_i2_10, counter=v_counter_21} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 18:41:28,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -276796036, now seen corresponding path program 1 times [2025-04-26 18:41:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587841304] [2025-04-26 18:41:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:28,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:28,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:28,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:28,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 18:41:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831846925] [2025-04-26 18:41:28,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 286984670, now seen corresponding path program 1 times [2025-04-26 18:41:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051056633] [2025-04-26 18:41:28,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:28,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:28,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:28,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051056633] [2025-04-26 18:41:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051056633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314916480] [2025-04-26 18:41:28,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:28,301 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:28,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:28,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:28,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:28,301 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:28,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:28,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:28,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:28,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:28,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:28,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,335 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:28,335 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:28,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:28,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:28,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:28,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,360 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:28,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:28,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:28,386 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:28,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:28,390 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:28,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:28,390 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:28,390 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:28,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:28,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:28,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:28,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:28,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:28,391 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:28,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,427 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:28,427 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:28,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:28,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:28,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:28,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:28,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:28,445 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:28,445 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:28,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:28,449 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:28,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:28,452 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:28,452 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:28,452 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 18:41:28,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:28,458 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:28,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:28,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:28,498 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:28,499 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 450 states and 1126 transitions. cyclomatic complexity: 783 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,540 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 450 states and 1126 transitions. cyclomatic complexity: 783. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 644 states and 1475 transitions. Complement of second has 5 states. [2025-04-26 18:41:28,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 18:41:28,544 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:28,544 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,544 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:28,544 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,544 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:28,544 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:28,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 644 states and 1475 transitions. [2025-04-26 18:41:28,550 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 18:41:28,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 644 states to 468 states and 1154 transitions. [2025-04-26 18:41:28,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2025-04-26 18:41:28,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 18:41:28,556 INFO L74 IsDeterministic]: Start isDeterministic. Operand 468 states and 1154 transitions. [2025-04-26 18:41:28,556 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:28,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 468 states and 1154 transitions. [2025-04-26 18:41:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 1154 transitions. [2025-04-26 18:41:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 462. [2025-04-26 18:41:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 2.4805194805194803) internal successors, (in total 1146), 461 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1146 transitions. [2025-04-26 18:41:28,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 462 states and 1146 transitions. [2025-04-26 18:41:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:28,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:28,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:28,579 INFO L87 Difference]: Start difference. First operand 462 states and 1146 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:28,643 INFO L93 Difference]: Finished difference Result 612 states and 1456 transitions. [2025-04-26 18:41:28,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 1456 transitions. [2025-04-26 18:41:28,648 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 325 [2025-04-26 18:41:28,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 609 states and 1453 transitions. [2025-04-26 18:41:28,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2025-04-26 18:41:28,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2025-04-26 18:41:28,654 INFO L74 IsDeterministic]: Start isDeterministic. Operand 609 states and 1453 transitions. [2025-04-26 18:41:28,654 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:28,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 609 states and 1453 transitions. [2025-04-26 18:41:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 1453 transitions. [2025-04-26 18:41:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 465. [2025-04-26 18:41:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 465 states have (on average 2.4731182795698925) internal successors, (in total 1150), 464 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1150 transitions. [2025-04-26 18:41:28,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 465 states and 1150 transitions. [2025-04-26 18:41:28,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:28,672 INFO L438 stractBuchiCegarLoop]: Abstraction has 465 states and 1150 transitions. [2025-04-26 18:41:28,672 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:28,672 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 1150 transitions. [2025-04-26 18:41:28,674 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 18:41:28,674 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:28,674 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:28,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:28,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:28,675 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L23-1-->L23: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[89] L23-->L23-1: Formula: (and (= v_counter_13 (+ v_counter_14 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_14} OutVars{i1=v_i1_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" "[86] L23-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:28,676 INFO L754 eck$LassoCheckResult]: Loop: "[91] L34-1-->L34: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[93] L34-->L34-1: Formula: (and (= v_counter_22 (+ v_counter_21 1)) (< 0 v_counter_22) (= v_i2_10 (+ v_i2_11 1))) InVars {i2=v_i2_11, counter=v_counter_22} OutVars{i2=v_i2_10, counter=v_counter_21} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 18:41:28,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 9305054, now seen corresponding path program 1 times [2025-04-26 18:41:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454750860] [2025-04-26 18:41:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:28,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:28,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 2 times [2025-04-26 18:41:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727819813] [2025-04-26 18:41:28,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:28,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 352225216, now seen corresponding path program 1 times [2025-04-26 18:41:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:28,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735955476] [2025-04-26 18:41:28,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:28,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:28,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:28,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:28,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:28,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:28,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:28,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:28,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:28,747 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:28,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:28,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:28,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:28,747 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:28,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:28,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:28,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:28,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:28,748 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:28,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,789 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:28,789 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:28,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:28,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:28,809 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:41:28,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,812 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:28,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:28,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:28,881 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:28,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:41:28,885 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:28,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:28,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:28,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:28,886 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:28,886 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,886 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:28,886 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:28,886 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:28,886 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:28,886 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:28,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:28,925 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:28,926 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:28,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:28,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:28,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:28,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:28,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:28,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:28,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:28,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:28,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:28,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:28,946 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:28,946 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:28,948 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:28,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:28,949 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:28,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:28,952 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:28,952 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:28,952 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 18:41:28,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:28,962 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:28,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:28,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:28,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:28,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:28,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:28,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:28,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:29,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:29,010 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 465 states and 1150 transitions. cyclomatic complexity: 794 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,060 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 465 states and 1150 transitions. cyclomatic complexity: 794. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1075 states and 2777 transitions. Complement of second has 6 states. [2025-04-26 18:41:29,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 18:41:29,061 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:29,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,062 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:29,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,062 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:29,062 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1075 states and 2777 transitions. [2025-04-26 18:41:29,069 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 150 [2025-04-26 18:41:29,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1075 states to 793 states and 1939 transitions. [2025-04-26 18:41:29,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2025-04-26 18:41:29,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2025-04-26 18:41:29,076 INFO L74 IsDeterministic]: Start isDeterministic. Operand 793 states and 1939 transitions. [2025-04-26 18:41:29,076 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 793 states and 1939 transitions. [2025-04-26 18:41:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states and 1939 transitions. [2025-04-26 18:41:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 626. [2025-04-26 18:41:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 2.511182108626198) internal successors, (in total 1572), 625 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1572 transitions. [2025-04-26 18:41:29,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 1572 transitions. [2025-04-26 18:41:29,088 INFO L438 stractBuchiCegarLoop]: Abstraction has 626 states and 1572 transitions. [2025-04-26 18:41:29,088 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:29,088 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 1572 transitions. [2025-04-26 18:41:29,090 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 150 [2025-04-26 18:41:29,090 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:29,090 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:29,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:29,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:29,091 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L23-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[88] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[91] L34-1-->L34: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:29,091 INFO L754 eck$LassoCheckResult]: Loop: "[95] L46-1-->L46: Formula: (< v_j1_2 v_M1_2) InVars {M1=v_M1_2, j1=v_j1_2} OutVars{M1=v_M1_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[97] L46-->L46-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter_25 (+ v_counter_26 1))) InVars {counter=v_counter_26, j1=v_j1_7} OutVars{counter=v_counter_25, j1=v_j1_6} AuxVars[] AssignedVars[counter, j1]" [2025-04-26 18:41:29,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash 286984687, now seen corresponding path program 1 times [2025-04-26 18:41:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665132654] [2025-04-26 18:41:29,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:29,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:29,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:29,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665132654] [2025-04-26 18:41:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665132654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135377639] [2025-04-26 18:41:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:29,137 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:29,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 18:41:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818508781] [2025-04-26 18:41:29,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:29,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:29,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:29,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:29,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:29,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:29,161 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:29,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:29,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:29,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:29,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:29,161 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:29,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,184 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:29,184 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,186 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:29,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:29,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:29,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,208 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:29,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:29,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:29,277 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:29,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:29,281 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:29,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:29,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:29,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:29,282 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:29,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:29,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:29,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:29,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:29,282 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:29,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,307 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:29,307 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:29,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,309 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:29,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:29,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:29,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:29,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:29,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:29,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:29,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:29,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:29,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:29,326 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:29,326 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:29,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,328 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:29,330 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:29,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:29,333 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:29,334 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:29,334 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 18:41:29,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:29,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:29,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:29,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:29,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:29,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:29,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:29,386 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:29,386 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 626 states and 1572 transitions. cyclomatic complexity: 1072 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,435 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 626 states and 1572 transitions. cyclomatic complexity: 1072. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 1735 states and 4370 transitions. Complement of second has 6 states. [2025-04-26 18:41:29,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 18:41:29,436 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:29,436 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,436 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:29,436 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,436 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:41:29,436 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1735 states and 4370 transitions. [2025-04-26 18:41:29,447 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:29,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1735 states to 744 states and 1803 transitions. [2025-04-26 18:41:29,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-04-26 18:41:29,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2025-04-26 18:41:29,452 INFO L74 IsDeterministic]: Start isDeterministic. Operand 744 states and 1803 transitions. [2025-04-26 18:41:29,452 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 744 states and 1803 transitions. [2025-04-26 18:41:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 1803 transitions. [2025-04-26 18:41:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 673. [2025-04-26 18:41:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 673 states have (on average 2.4903417533432393) internal successors, (in total 1676), 672 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1676 transitions. [2025-04-26 18:41:29,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 673 states and 1676 transitions. [2025-04-26 18:41:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:29,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:29,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:29,472 INFO L87 Difference]: Start difference. First operand 673 states and 1676 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:29,525 INFO L93 Difference]: Finished difference Result 716 states and 1750 transitions. [2025-04-26 18:41:29,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1750 transitions. [2025-04-26 18:41:29,529 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 44 [2025-04-26 18:41:29,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 714 states and 1748 transitions. [2025-04-26 18:41:29,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-04-26 18:41:29,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2025-04-26 18:41:29,533 INFO L74 IsDeterministic]: Start isDeterministic. Operand 714 states and 1748 transitions. [2025-04-26 18:41:29,533 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 714 states and 1748 transitions. [2025-04-26 18:41:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states and 1748 transitions. [2025-04-26 18:41:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 671. [2025-04-26 18:41:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 671 states have (on average 2.4932935916542474) internal successors, (in total 1673), 670 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1673 transitions. [2025-04-26 18:41:29,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1673 transitions. [2025-04-26 18:41:29,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:41:29,545 INFO L438 stractBuchiCegarLoop]: Abstraction has 671 states and 1673 transitions. [2025-04-26 18:41:29,545 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:29,545 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 1673 transitions. [2025-04-26 18:41:29,547 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:29,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:29,547 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:29,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:29,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:29,548 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L23-1-->L23: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[89] L23-->L23-1: Formula: (and (= v_counter_13 (+ v_counter_14 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_14} OutVars{i1=v_i1_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" "[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[86] L23-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[90] L34-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" "[113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[94] L46-1-->thread3FINAL: Formula: (<= v_M1_3 v_j1_5) InVars {M1=v_M1_3, j1=v_j1_5} OutVars{M1=v_M1_3, j1=v_j1_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:29,548 INFO L754 eck$LassoCheckResult]: Loop: "[99] L57-1-->L57: Formula: (< v_j2_2 v_M2_2) InVars {j2=v_j2_2, M2=v_M2_2} OutVars{j2=v_j2_2, M2=v_M2_2} AuxVars[] AssignedVars[]" "[101] L57-->L57-1: Formula: (and (< 0 v_counter_34) (= (+ v_j2_11 1) v_j2_10) (= v_counter_34 (+ v_counter_33 1))) InVars {j2=v_j2_11, counter=v_counter_34} OutVars{j2=v_j2_10, counter=v_counter_33} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 18:41:29,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash -791967545, now seen corresponding path program 1 times [2025-04-26 18:41:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910004216] [2025-04-26 18:41:29,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:29,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:29,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910004216] [2025-04-26 18:41:29,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910004216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:29,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:41:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51438469] [2025-04-26 18:41:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:29,623 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:29,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 18:41:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587955877] [2025-04-26 18:41:29,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:29,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:29,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:29,647 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:29,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:29,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:29,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:29,647 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:29,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:29,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:29,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:29,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:29,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:29,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,670 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:29,670 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:29,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,672 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:29,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:29,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:29,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:41:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,692 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:41:29,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:29,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:29,715 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:29,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:41:29,719 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:29,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:29,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:29,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:29,719 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:29,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:29,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:29,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 18:41:29,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:29,719 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:29,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:29,747 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:29,747 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:29,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,749 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:41:29,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:41:29,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:29,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:29,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:29,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:29,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:29,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:29,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:29,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:29,766 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:29,766 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:29,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:29,768 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:29,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:41:29,770 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:29,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:41:29,774 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:29,774 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:29,774 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 18:41:29,779 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:41:29,780 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:29,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:29,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:29,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:29,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:29,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:29,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:29,832 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:29,833 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 671 states and 1673 transitions. cyclomatic complexity: 1098 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,867 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 671 states and 1673 transitions. cyclomatic complexity: 1098. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1151 states and 2754 transitions. Complement of second has 5 states. [2025-04-26 18:41:29,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 18:41:29,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:29,869 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:29,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:41:29,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:29,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1151 states and 2754 transitions. [2025-04-26 18:41:29,877 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:29,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1151 states to 355 states and 798 transitions. [2025-04-26 18:41:29,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-04-26 18:41:29,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 18:41:29,880 INFO L74 IsDeterministic]: Start isDeterministic. Operand 355 states and 798 transitions. [2025-04-26 18:41:29,880 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 355 states and 798 transitions. [2025-04-26 18:41:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 798 transitions. [2025-04-26 18:41:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 312. [2025-04-26 18:41:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 312 states have (on average 2.391025641025641) internal successors, (in total 746), 311 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 746 transitions. [2025-04-26 18:41:29,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 312 states and 746 transitions. [2025-04-26 18:41:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:29,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 18:41:29,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-26 18:41:29,886 INFO L87 Difference]: Start difference. First operand 312 states and 746 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (in total 12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:29,941 INFO L93 Difference]: Finished difference Result 470 states and 1099 transitions. [2025-04-26 18:41:29,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 1099 transitions. [2025-04-26 18:41:29,943 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:29,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 459 states and 1084 transitions. [2025-04-26 18:41:29,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-04-26 18:41:29,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-04-26 18:41:29,947 INFO L74 IsDeterministic]: Start isDeterministic. Operand 459 states and 1084 transitions. [2025-04-26 18:41:29,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:29,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 459 states and 1084 transitions. [2025-04-26 18:41:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 1084 transitions. [2025-04-26 18:41:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 359. [2025-04-26 18:41:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 2.401114206128134) internal successors, (in total 862), 358 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 862 transitions. [2025-04-26 18:41:29,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 359 states and 862 transitions. [2025-04-26 18:41:29,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:29,955 INFO L438 stractBuchiCegarLoop]: Abstraction has 359 states and 862 transitions. [2025-04-26 18:41:29,956 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:29,956 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 862 transitions. [2025-04-26 18:41:29,957 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:41:29,957 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:29,957 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:29,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:29,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:29,959 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L69: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[64] L69-->L70: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[83] L70-->L71: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L23-1-->L23: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[89] L23-->L23-1: Formula: (and (= v_counter_13 (+ v_counter_14 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_14} OutVars{i1=v_i1_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" "[110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[87] L23-1-->L23: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[94] L46-1-->thread3FINAL: Formula: (<= v_M1_3 v_j1_5) InVars {M1=v_M1_3, j1=v_j1_5} OutVars{M1=v_M1_3, j1=v_j1_5} AuxVars[] AssignedVars[]" "[89] L23-->L23-1: Formula: (and (= v_counter_13 (+ v_counter_14 1)) (= v_i1_6 (+ v_i1_7 1))) InVars {i1=v_i1_7, counter=v_counter_14} OutVars{i1=v_i1_6, counter=v_counter_13} AuxVars[] AssignedVars[counter, i1]" "[113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[86] L23-1-->thread1FINAL: Formula: (<= v_N1_2 v_i1_4) InVars {i1=v_i1_4, N1=v_N1_2} OutVars{i1=v_i1_4, N1=v_N1_2} AuxVars[] AssignedVars[]" "[91] L34-1-->L34: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[93] L34-->L34-1: Formula: (and (= v_counter_22 (+ v_counter_21 1)) (< 0 v_counter_22) (= v_i2_10 (+ v_i2_11 1))) InVars {i2=v_i2_11, counter=v_counter_22} OutVars{i2=v_i2_10, counter=v_counter_21} AuxVars[] AssignedVars[counter, i2]" "[90] L34-1-->thread2FINAL: Formula: (<= v_N2_2 v_i2_4) InVars {N2=v_N2_2, i2=v_i2_4} OutVars{N2=v_N2_2, i2=v_i2_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:29,959 INFO L754 eck$LassoCheckResult]: Loop: "[99] L57-1-->L57: Formula: (< v_j2_2 v_M2_2) InVars {j2=v_j2_2, M2=v_M2_2} OutVars{j2=v_j2_2, M2=v_M2_2} AuxVars[] AssignedVars[]" "[101] L57-->L57-1: Formula: (and (< 0 v_counter_34) (= (+ v_j2_11 1) v_j2_10) (= v_counter_34 (+ v_counter_33 1))) InVars {j2=v_j2_11, counter=v_counter_34} OutVars{j2=v_j2_10, counter=v_counter_33} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 18:41:29,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 242601975, now seen corresponding path program 1 times [2025-04-26 18:41:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:29,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162316857] [2025-04-26 18:41:29,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:29,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:29,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:30,053 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:41:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:30,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162316857] [2025-04-26 18:41:30,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162316857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:30,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:30,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:41:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650535773] [2025-04-26 18:41:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:30,053 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:30,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 2 times [2025-04-26 18:41:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:30,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892381958] [2025-04-26 18:41:30,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:30,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:30,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:30,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:30,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:30,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:30,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:30,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:30,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:30,080 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:30,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:30,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:30,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:30,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:30,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:30,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:30,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 18:41:30,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:30,080 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:30,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:30,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:30,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:30,112 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:30,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,114 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:30,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:41:30,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:30,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:30,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:41:30,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,137 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:30,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:41:30,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:30,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:30,203 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:30,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:41:30,208 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:30,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:30,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:30,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:30,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:30,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:30,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:30,208 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 18:41:30,208 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:30,208 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:30,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:30,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:30,235 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:30,235 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:30,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,237 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:30,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:41:30,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:30,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:30,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:30,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:30,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:30,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:30,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:30,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:30,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:30,255 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:30,255 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:30,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:30,257 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:30,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:41:30,259 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:30,262 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:41:30,263 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:30,263 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:30,264 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M2, j2) = 1*M2 - 1*j2 Supporting invariants [] [2025-04-26 18:41:30,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:41:30,269 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:30,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:41:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:41:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:30,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:30,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:30,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:30,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:30,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:30,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:30,323 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 359 states and 862 transitions. cyclomatic complexity: 565 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:30,361 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 359 states and 862 transitions. cyclomatic complexity: 565. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 670 states and 1507 transitions. Complement of second has 6 states. [2025-04-26 18:41:30,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 18:41:30,362 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:41:30,362 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:30,362 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 18:41:30,362 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:30,362 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 18:41:30,363 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:30,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 1507 transitions. [2025-04-26 18:41:30,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:30,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 0 states and 0 transitions. [2025-04-26 18:41:30,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:30,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:30,366 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:30,366 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:30,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:30,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:30,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:30,367 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:30,367 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:30,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:30,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:30,367 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:30,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:30,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:41:30,368 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:30,368 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:30,368 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:30,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:30,368 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:30,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:30,380 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:30 BoogieIcfgContainer [2025-04-26 18:41:30,380 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:30,380 INFO L158 Benchmark]: Toolchain (without parser) took 3879.66ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 82.8MB in the beginning and 51.9MB in the end (delta: 30.8MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:30,380 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:30,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:30,381 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:30,381 INFO L158 Benchmark]: RCFGBuilder took 193.07ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:30,381 INFO L158 Benchmark]: BuchiAutomizer took 3629.14ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 69.3MB in the beginning and 51.9MB in the end (delta: 17.4MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2025-04-26 18:41:30,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.19ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 80.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 193.07ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3629.14ms. Allocated memory was 155.2MB in the beginning and 167.8MB in the end (delta: 12.6MB). Free memory was 69.3MB in the beginning and 51.9MB in the end (delta: 17.4MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 649 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 182 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp63 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 353, Number of transitions in reduction automaton: 1059, Number of states in reduction automaton: 424, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (4 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * j2 + M2 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:30,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...