/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 16:55:52,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:52,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:52,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:52,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:52,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:52,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:52,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:52,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:52,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:52,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:52,411 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:52,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:52,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:52,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:52,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:52,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:52,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:52,413 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:52,413 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:52,413 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:52,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:52,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:52,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:52,624 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:52,624 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:52,626 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 16:55:52,627 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 16:55:52,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:52,648 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:52,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:52,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:52,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:52,656 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,678 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,682 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:52,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:52,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:52,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:52,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:52,688 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,688 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,688 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,688 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,690 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,690 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,694 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,694 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,694 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:52,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:52,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:52,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:52,702 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 04:55:52" (1/1) ... [2025-04-26 16:55:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:52,723 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 16:55:52,727 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 16:55:52,746 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:52,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:52,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:52,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:52,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:55:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:55:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:55:52,748 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 16:55:52,785 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:52,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:52,873 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:52,874 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:52,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:52,894 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:52,895 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:52 BoogieIcfgContainer [2025-04-26 16:55:52,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:52,897 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:52,897 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:52,901 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:52,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:52,902 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 04:55:52" (1/2) ... [2025-04-26 16:55:52,903 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1776874d and model type counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:52, skipping insertion in model container [2025-04-26 16:55:52,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:52,903 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 04:55:52" (2/2) ... [2025-04-26 16:55:52,904 INFO L376 chiAutomizerObserver]: Analyzing ICFG counter-add-4-semi-Q67.wvr.bpl [2025-04-26 16:55:52,969 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:55:53,009 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,013 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 16:55:53,015 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 16:55:53,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:53,087 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 16:55:53,088 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:55:53,092 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 16:55:53,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:53,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:53,096 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:53,103 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:53,344 WARN L140 AmpleReduction]: Number of pruned transitions: 553 [2025-04-26 16:55:53,345 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:53,345 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 172 [2025-04-26 16:55:53,345 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 16:55:53,345 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:224 [2025-04-26 16:55:53,345 WARN L145 AmpleReduction]: Times succ was already a loop node:336 [2025-04-26 16:55:53,345 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:37 [2025-04-26 16:55:53,345 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:53,350 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 16:55:53,356 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:53,356 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:53,356 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:53,356 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:53,356 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:53,356 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:53,356 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:53,356 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:53,358 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 16:55:53,382 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 366 [2025-04-26 16:55:53,382 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:53,382 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:53,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:53,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:53,387 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:53,388 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 16:55:53,405 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 366 [2025-04-26 16:55:53,405 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:53,405 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:53,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:53,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:53,410 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 16:55:53,410 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 16:55:53,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 3162445, now seen corresponding path program 1 times [2025-04-26 16:55:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117262512] [2025-04-26 16:55:53,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:53,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:53,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:53,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 16:55:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550306329] [2025-04-26 16:55:53,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:53,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:53,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:53,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1255854865, now seen corresponding path program 1 times [2025-04-26 16:55:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:53,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578055030] [2025-04-26 16:55:53,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:53,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:53,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:53,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:53,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:53,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:53,604 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:53,604 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:53,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:53,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:53,604 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:53,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,605 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:53,605 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:53,605 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:53,605 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:53,605 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:53,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,717 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:53,718 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,721 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 16:55:53,723 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 16:55:53,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:53,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:53,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:53,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,744 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 16:55:53,745 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 16:55:53,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:53,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:53,773 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:53,773 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 16:55:53,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:55:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,781 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 16:55:53,783 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 16:55:53,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:53,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:53,801 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 16:55:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,803 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 16:55:53,805 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 16:55:53,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:53,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:53,871 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:53,875 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 16:55:53,875 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:53,875 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:53,875 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:53,875 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:53,875 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:53,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:53,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:53,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:53,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:53,875 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:53,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:53,913 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:53,916 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:53,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,920 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 16:55:53,921 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 16:55:53,922 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 16:55:53,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:53,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:53,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:53,938 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:53,943 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 16:55:53,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,945 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 16:55:53,946 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 16:55:53,947 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 16:55:53,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:53,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:53,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:53,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:53,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:53,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:53,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:53,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:53,964 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:55:53,964 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:53,967 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 16:55:53,968 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 16:55:53,968 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:53,971 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 16:55:53,971 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:53,971 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:53,972 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 16:55:53,977 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 16:55:53,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:54,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:54,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:54,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,055 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 16:55:54,069 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 16:55:54,071 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 16:55:54,187 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 16:55:54,191 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 16:55:54,194 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 16:55:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-26 16:55:54,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:55:54,201 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,201 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:55:54,201 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,201 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:55:54,201 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1008 states and 2520 transitions. [2025-04-26 16:55:54,216 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 16:55:54,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1008 states to 525 states and 1304 transitions. [2025-04-26 16:55:54,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2025-04-26 16:55:54,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2025-04-26 16:55:54,231 INFO L74 IsDeterministic]: Start isDeterministic. Operand 525 states and 1304 transitions. [2025-04-26 16:55:54,232 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 525 states and 1304 transitions. [2025-04-26 16:55:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 1304 transitions. [2025-04-26 16:55:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 450. [2025-04-26 16:55:54,279 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 16:55:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1126 transitions. [2025-04-26 16:55:54,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 450 states and 1126 transitions. [2025-04-26 16:55:54,282 INFO L438 stractBuchiCegarLoop]: Abstraction has 450 states and 1126 transitions. [2025-04-26 16:55:54,282 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:54,282 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 1126 transitions. [2025-04-26 16:55:54,287 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 16:55:54,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:54,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:54,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:54,288 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 16:55:54,288 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 16:55:54,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash -276796036, now seen corresponding path program 1 times [2025-04-26 16:55:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142003843] [2025-04-26 16:55:54,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:54,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:54,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:54,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 16:55:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828617158] [2025-04-26 16:55:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 286984670, now seen corresponding path program 1 times [2025-04-26 16:55:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54812382] [2025-04-26 16:55:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:54,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:54,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,406 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 16:55:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:54,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54812382] [2025-04-26 16:55:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54812382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709203028] [2025-04-26 16:55:54,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:54,435 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,436 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:54,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:55:54,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,436 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,468 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:54,468 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:54,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,471 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 16:55:54,472 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 16:55:54,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:54,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:54,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:55:54,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,491 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 16:55:54,493 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 16:55:54,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:54,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:54,517 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:54,521 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 16:55:54,521 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:54,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:55:54,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,521 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,554 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:54,554 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,556 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 16:55:54,557 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 16:55:54,557 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 16:55:54,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:54,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:54,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:54,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:54,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:54,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:54,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:54,570 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:54,571 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:55:54,571 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:54,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,573 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 16:55:54,574 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 16:55:54,574 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:54,577 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 16:55:54,577 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:54,577 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:54,578 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:55:54,583 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 16:55:54,584 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:54,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:54,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:54,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:54,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:54,620 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 16:55:54,620 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 16:55:54,620 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 16:55:54,647 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 16:55:54,647 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 16:55:54,648 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 16:55:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-26 16:55:54,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:54,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:54,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,648 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:54,648 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:54,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 644 states and 1475 transitions. [2025-04-26 16:55:54,653 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 16:55:54,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 644 states to 468 states and 1154 transitions. [2025-04-26 16:55:54,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2025-04-26 16:55:54,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 16:55:54,657 INFO L74 IsDeterministic]: Start isDeterministic. Operand 468 states and 1154 transitions. [2025-04-26 16:55:54,657 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 468 states and 1154 transitions. [2025-04-26 16:55:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 1154 transitions. [2025-04-26 16:55:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 462. [2025-04-26 16:55:54,676 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 16:55:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1146 transitions. [2025-04-26 16:55:54,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 462 states and 1146 transitions. [2025-04-26 16:55:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:54,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:54,682 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 16:55:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:54,739 INFO L93 Difference]: Finished difference Result 612 states and 1456 transitions. [2025-04-26 16:55:54,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 1456 transitions. [2025-04-26 16:55:54,744 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 325 [2025-04-26 16:55:54,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 609 states and 1453 transitions. [2025-04-26 16:55:54,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2025-04-26 16:55:54,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2025-04-26 16:55:54,751 INFO L74 IsDeterministic]: Start isDeterministic. Operand 609 states and 1453 transitions. [2025-04-26 16:55:54,751 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:54,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 609 states and 1453 transitions. [2025-04-26 16:55:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 1453 transitions. [2025-04-26 16:55:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 465. [2025-04-26 16:55:54,776 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 16:55:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1150 transitions. [2025-04-26 16:55:54,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 465 states and 1150 transitions. [2025-04-26 16:55:54,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:54,779 INFO L438 stractBuchiCegarLoop]: Abstraction has 465 states and 1150 transitions. [2025-04-26 16:55:54,779 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:54,779 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 1150 transitions. [2025-04-26 16:55:54,781 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 196 [2025-04-26 16:55:54,781 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:54,781 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:54,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:54,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:54,782 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 16:55:54,782 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 16:55:54,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 9305054, now seen corresponding path program 1 times [2025-04-26 16:55:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140276903] [2025-04-26 16:55:54,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:54,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:54,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 2 times [2025-04-26 16:55:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499759888] [2025-04-26 16:55:54,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:54,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:54,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:54,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 352225216, now seen corresponding path program 1 times [2025-04-26 16:55:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:54,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858907806] [2025-04-26 16:55:54,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:54,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:54,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:54,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:54,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:54,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:54,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:54,864 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,865 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:54,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:54,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,865 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:54,897 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:54,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,899 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 16:55:54,900 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 16:55:54,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:54,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:54,917 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 16:55:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:54,919 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 16:55:54,919 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 16:55:54,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:54,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:54,984 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:54,988 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 16:55:54,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:54,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:54,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:54,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:54,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:54,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:54,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:54,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:54,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:54,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:54,989 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:54,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:54,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,023 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,023 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,025 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 16:55:55,027 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 16:55:55,028 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 16:55:55,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:55,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:55,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:55,041 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:55,045 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:55:55,045 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:55,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,048 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 16:55:55,048 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 16:55:55,049 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:55,052 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 16:55:55,053 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:55,053 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:55,053 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2025-04-26 16:55:55,058 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 16:55:55,059 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:55,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:55,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:55,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,105 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 16:55:55,105 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 16:55:55,105 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 16:55:55,150 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 16:55:55,150 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 16:55:55,151 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 16:55:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 16:55:55,151 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:55:55,151 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,151 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:55,151 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,151 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:55:55,151 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1075 states and 2777 transitions. [2025-04-26 16:55:55,158 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 150 [2025-04-26 16:55:55,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1075 states to 793 states and 1939 transitions. [2025-04-26 16:55:55,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2025-04-26 16:55:55,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2025-04-26 16:55:55,163 INFO L74 IsDeterministic]: Start isDeterministic. Operand 793 states and 1939 transitions. [2025-04-26 16:55:55,163 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,163 INFO L218 hiAutomatonCegarLoop]: Abstraction has 793 states and 1939 transitions. [2025-04-26 16:55:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states and 1939 transitions. [2025-04-26 16:55:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 626. [2025-04-26 16:55:55,173 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 16:55:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1572 transitions. [2025-04-26 16:55:55,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 1572 transitions. [2025-04-26 16:55:55,174 INFO L438 stractBuchiCegarLoop]: Abstraction has 626 states and 1572 transitions. [2025-04-26 16:55:55,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:55,174 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 1572 transitions. [2025-04-26 16:55:55,177 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 150 [2025-04-26 16:55:55,177 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:55,177 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:55,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:55,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:55,177 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 16:55:55,177 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 16:55:55,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 286984687, now seen corresponding path program 1 times [2025-04-26 16:55:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874169206] [2025-04-26 16:55:55,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:55,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:55,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,211 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 16:55:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:55,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874169206] [2025-04-26 16:55:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874169206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:55,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431352939] [2025-04-26 16:55:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:55,212 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:55,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 16:55:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795248676] [2025-04-26 16:55:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,231 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,231 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:55,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:55:55,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,231 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,264 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,264 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,266 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 16:55:55,267 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 16:55:55,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:55,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:55,284 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 16:55:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,286 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 16:55:55,287 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 16:55:55,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:55,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:55,349 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:55,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:55:55,354 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,354 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:55,355 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,355 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,355 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,355 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:55:55,355 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,355 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,380 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,380 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,382 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 16:55:55,384 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 16:55:55,384 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 16:55:55,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:55,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:55,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:55,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:55,400 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:55,400 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:55,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,402 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 16:55:55,403 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 16:55:55,404 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:55,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,407 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:55,407 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:55,408 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 16:55:55,414 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 16:55:55,414 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:55,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,460 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 16:55:55,460 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 16:55:55,461 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 16:55:55,510 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 16:55:55,510 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 16:55:55,511 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 16:55:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 16:55:55,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:55,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:55,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:55:55,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1735 states and 4370 transitions. [2025-04-26 16:55:55,538 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:55:55,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1735 states to 744 states and 1803 transitions. [2025-04-26 16:55:55,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-04-26 16:55:55,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2025-04-26 16:55:55,543 INFO L74 IsDeterministic]: Start isDeterministic. Operand 744 states and 1803 transitions. [2025-04-26 16:55:55,544 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 744 states and 1803 transitions. [2025-04-26 16:55:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 1803 transitions. [2025-04-26 16:55:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 673. [2025-04-26 16:55:55,555 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 16:55:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1676 transitions. [2025-04-26 16:55:55,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 673 states and 1676 transitions. [2025-04-26 16:55:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:55,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:55,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:55,558 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 16:55:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:55,618 INFO L93 Difference]: Finished difference Result 716 states and 1750 transitions. [2025-04-26 16:55:55,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1750 transitions. [2025-04-26 16:55:55,622 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 44 [2025-04-26 16:55:55,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 714 states and 1748 transitions. [2025-04-26 16:55:55,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-04-26 16:55:55,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2025-04-26 16:55:55,627 INFO L74 IsDeterministic]: Start isDeterministic. Operand 714 states and 1748 transitions. [2025-04-26 16:55:55,627 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 714 states and 1748 transitions. [2025-04-26 16:55:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states and 1748 transitions. [2025-04-26 16:55:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 671. [2025-04-26 16:55:55,636 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 16:55:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1673 transitions. [2025-04-26 16:55:55,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1673 transitions. [2025-04-26 16:55:55,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:55:55,638 INFO L438 stractBuchiCegarLoop]: Abstraction has 671 states and 1673 transitions. [2025-04-26 16:55:55,638 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:55,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 1673 transitions. [2025-04-26 16:55:55,640 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:55:55,640 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:55,640 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:55,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:55,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:55,641 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 16:55:55,641 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 16:55:55,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -791967545, now seen corresponding path program 1 times [2025-04-26 16:55:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707918273] [2025-04-26 16:55:55,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,710 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 16:55:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:55,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707918273] [2025-04-26 16:55:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707918273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:55,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:55,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:55:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991895217] [2025-04-26 16:55:55,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:55,711 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:55,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 16:55:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:55,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075719226] [2025-04-26 16:55:55,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:55,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:55,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:55,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:55,738 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,738 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,738 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,738 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:55,738 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,738 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,738 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,738 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 16:55:55,738 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,738 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,768 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,768 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:55,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,772 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 16:55:55,773 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 16:55:55,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:55,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:55,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,793 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 16:55:55,794 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 16:55:55,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:55,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:55,817 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:55,821 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 16:55:55,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:55,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:55,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:55,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:55,821 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:55,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:55,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:55,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration5_Loop [2025-04-26 16:55:55,821 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:55,821 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:55,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:55,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:55,845 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,847 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 16:55:55,848 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 16:55:55,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:55,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:55,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:55,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:55,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:55,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:55,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:55,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:55,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:55,863 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:55,863 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:55,865 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 16:55:55,865 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 16:55:55,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:55,868 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 16:55:55,869 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:55,869 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:55,869 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2025-04-26 16:55:55,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:55:55,875 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:55,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:55,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:55,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:55,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:55,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:55,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:55,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:55,917 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 16:55:55,918 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 16:55:55,918 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 16:55:55,947 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 16:55:55,947 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 16:55:55,948 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 16:55:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:55:55,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:55,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:55,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:55:55,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:55,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1151 states and 2754 transitions. [2025-04-26 16:55:55,954 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:55:55,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1151 states to 355 states and 798 transitions. [2025-04-26 16:55:55,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-04-26 16:55:55,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 16:55:55,956 INFO L74 IsDeterministic]: Start isDeterministic. Operand 355 states and 798 transitions. [2025-04-26 16:55:55,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:55,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 355 states and 798 transitions. [2025-04-26 16:55:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 798 transitions. [2025-04-26 16:55:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 312. [2025-04-26 16:55:55,961 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 16:55:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 746 transitions. [2025-04-26 16:55:55,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 312 states and 746 transitions. [2025-04-26 16:55:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:55,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:55:55,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:55:55,962 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 16:55:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:56,018 INFO L93 Difference]: Finished difference Result 470 states and 1099 transitions. [2025-04-26 16:55:56,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 1099 transitions. [2025-04-26 16:55:56,021 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:55:56,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 459 states and 1084 transitions. [2025-04-26 16:55:56,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-04-26 16:55:56,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-04-26 16:55:56,024 INFO L74 IsDeterministic]: Start isDeterministic. Operand 459 states and 1084 transitions. [2025-04-26 16:55:56,024 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:56,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 459 states and 1084 transitions. [2025-04-26 16:55:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 1084 transitions. [2025-04-26 16:55:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 359. [2025-04-26 16:55:56,030 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 16:55:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 862 transitions. [2025-04-26 16:55:56,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 359 states and 862 transitions. [2025-04-26 16:55:56,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:56,033 INFO L438 stractBuchiCegarLoop]: Abstraction has 359 states and 862 transitions. [2025-04-26 16:55:56,033 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:56,033 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 359 states and 862 transitions. [2025-04-26 16:55:56,034 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 16:55:56,034 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:56,034 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:56,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:56,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:56,036 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 16:55:56,036 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 16:55:56,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 242601975, now seen corresponding path program 1 times [2025-04-26 16:55:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729729282] [2025-04-26 16:55:56,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:55:56,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,122 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 16:55:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:56,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729729282] [2025-04-26 16:55:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729729282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:55:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096142458] [2025-04-26 16:55:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:56,122 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:56,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 2 times [2025-04-26 16:55:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:56,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328605542] [2025-04-26 16:55:56,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:56,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:56,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:56,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:56,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:56,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:56,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:56,144 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:56,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:56,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:56,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:56,145 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:56,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:56,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:56,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 16:55:56,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:56,145 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:56,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,175 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:56,175 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,177 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 16:55:56,178 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 16:55:56,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:56,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:56,195 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 16:55:56,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,197 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 16:55:56,198 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 16:55:56,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:56,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:56,259 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:56,264 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 16:55:56,264 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:56,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:56,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:56,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:56,264 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:56,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:56,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:56,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_petrified1_Iteration6_Loop [2025-04-26 16:55:56,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:56,265 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:56,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:56,290 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:56,291 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,292 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 16:55:56,293 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 16:55:56,294 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 16:55:56,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:56,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:56,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:56,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:56,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:56,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:56,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:56,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:56,309 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:56,309 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:56,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:56,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:56,312 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 16:55:56,313 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 16:55:56,317 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:55:56,321 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:56,321 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:56,321 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M2, j2) = 1*M2 - 1*j2 Supporting invariants [] [2025-04-26 16:55:56,327 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 16:55:56,327 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:56,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:56,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:55:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:55:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:56,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:56,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:56,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:56,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:56,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:56,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:56,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:56,373 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 16:55:56,373 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 16:55:56,374 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 16:55:56,411 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 16:55:56,411 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 16:55:56,411 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 16:55:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 16:55:56,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:55:56,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:55:56,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:55:56,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:56,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 1507 transitions. [2025-04-26 16:55:56,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:56,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 0 states and 0 transitions. [2025-04-26 16:55:56,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:56,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:56,415 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,415 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:56,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:56,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:56,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:56,416 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 16:55:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:56,416 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:56,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:56,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:56,416 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:56,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:55:56,416 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:56,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:56,416 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:56,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:56,417 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:56,428 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 16:55:56,429 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:56 BoogieIcfgContainer [2025-04-26 16:55:56,429 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:56,430 INFO L158 Benchmark]: Toolchain (without parser) took 3783.06ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 81.8MB in the beginning and 76.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,430 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.03ms. Allocated memory is still 155.2MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.21ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,430 INFO L158 Benchmark]: Boogie Preprocessor took 17.91ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 982.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:56,431 INFO L158 Benchmark]: RCFGBuilder took 193.76ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 68.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:56,432 INFO L158 Benchmark]: BuchiAutomizer took 3532.64ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 68.4MB in the beginning and 76.9MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:56,432 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 1.03ms. Allocated memory is still 155.2MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.21ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.91ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 982.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 193.76ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 68.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3532.64ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 68.4MB in the beginning and 76.9MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s 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: 21ms 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]: 341, 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 16:55:56,445 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...