/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/unroll-cond-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:54,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:54,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:54,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:54,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:54,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:54,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:54,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:54,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:54,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:54,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:54,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:54,219 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:54,219 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:54,219 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:54,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:54,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:54,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:54,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:54,222 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:54,222 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:54,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:54,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:54,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:54,432 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:54,433 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:54,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl [2025-04-26 18:39:54,436 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-2.wvr.bpl' [2025-04-26 18:39:54,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:54,455 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:54,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:54,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:54,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:54,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,489 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:54,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:54,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:54,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:54,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:54,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:54,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:54,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:54,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:54,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:54,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:39:54,560 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:54,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:54,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:54,561 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:39:54,596 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:54,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:54,655 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:54,656 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:54,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:54,677 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 18:39:54,677 INFO L201 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:54 BoogieIcfgContainer [2025-04-26 18:39:54,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:54,678 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:54,678 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:54,682 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:54,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:54,683 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/2) ... [2025-04-26 18:39:54,684 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cb4f662 and model type unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:54, skipping insertion in model container [2025-04-26 18:39:54,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:54,684 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:54" (2/2) ... [2025-04-26 18:39:54,685 INFO L376 chiAutomizerObserver]: Analyzing ICFG unroll-cond-2.wvr.bpl [2025-04-26 18:39:54,718 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:54,749 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:54,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:54,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:54,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:39:54,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 18:39:54,812 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-26 18:39:54,813 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2025-04-26 18:39:54,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 18:39:54,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:54,818 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:54,818 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:54,829 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 20 states have (on average 1.85) internal successors, (in total 37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:54,829 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 22 states, 20 states have (on average 1.85) internal successors, (in total 37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:54,831 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:54,850 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 41#[thread1EXIT, L53, L33]true [2025-04-26 18:39:54,851 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29#[L20, L52-1]true [2025-04-26 18:39:54,852 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37#[L53, L33, thread1FINAL]true [2025-04-26 18:39:54,852 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33#[L53, L20, L33]true [2025-04-26 18:39:54,853 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[thread2FINAL, L20, L53]true [2025-04-26 18:39:54,853 WARN L140 AmpleReduction]: Number of pruned transitions: 4 [2025-04-26 18:39:54,853 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 18:39:54,854 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:39:54,854 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 18:39:54,854 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8 [2025-04-26 18:39:54,854 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:39:54,854 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:39:54,854 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:54,854 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:54,860 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:54,860 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:54,860 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:54,860 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:54,860 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:54,861 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:54,861 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:54,861 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:54,862 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:54,870 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:39:54,871 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:54,871 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:54,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:54,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:54,873 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:54,874 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:54,878 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:39:54,878 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:54,878 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:54,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:54,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:54,881 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[]" "[60] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:54,882 INFO L754 eck$LassoCheckResult]: Loop: "[53] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (< v_i1_11 v_n_7) (= v_x1_9 (select v_f_7 v_x1_10))) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_7, f=v_f_7} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_7, f=v_f_7} AuxVars[] AssignedVars[i1, x1]" [2025-04-26 18:39:54,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2416, now seen corresponding path program 1 times [2025-04-26 18:39:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:54,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758195287] [2025-04-26 18:39:54,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:54,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:54,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:54,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:54,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:54,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:54,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2025-04-26 18:39:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:54,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968143216] [2025-04-26 18:39:54,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:54,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:54,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:54,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:54,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:54,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:54,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:54,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash 74949, now seen corresponding path program 1 times [2025-04-26 18:39:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:54,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127360900] [2025-04-26 18:39:54,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:54,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:54,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:54,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:54,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:54,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:54,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:54,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:54,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,066 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:55,066 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:55,067 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:55,067 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:55,067 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:55,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:55,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:55,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:55,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:55,067 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:55,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,206 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:55,229 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:55,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:39:55,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,265 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:55,273 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:55,274 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:39:55,300 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:55,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:55,317 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:55,318 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:55,318 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2025-04-26 18:39:55,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:55,326 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:55,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:55,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:55,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:55,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:55,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:55,422 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:55,423 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:55,471 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 49 states and 88 transitions. Complement of second has 5 states. [2025-04-26 18:39:55,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:39:55,481 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:39:55,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:39:55,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:55,482 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 88 transitions. [2025-04-26 18:39:55,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:55,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 14 states and 27 transitions. [2025-04-26 18:39:55,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 18:39:55,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-04-26 18:39:55,491 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14 states and 27 transitions. [2025-04-26 18:39:55,492 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:55,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 27 transitions. [2025-04-26 18:39:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 27 transitions. [2025-04-26 18:39:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-04-26 18:39:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (in total 24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2025-04-26 18:39:55,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 18:39:55,510 INFO L438 stractBuchiCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 18:39:55,510 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:55,510 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 24 transitions. [2025-04-26 18:39:55,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:55,510 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:55,510 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:55,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:55,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:55,511 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L52: Formula: (and (= v_i1_5 v_x2_7) (= v_i1_5 0) (= v_i1_5 v_i2_10) (= v_i1_5 v_x1_3)) InVars {i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} OutVars{i1=v_i1_5, i2=v_i2_10, x1=v_x1_3, x2=v_x2_7} AuxVars[] AssignedVars[]" "[60] L52-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[63] L52-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:39:55,511 INFO L754 eck$LassoCheckResult]: Loop: "[56] L33-->L33: Formula: (and (= (select v_f_19 (select v_f_19 v_x2_32)) v_x2_31) (< (+ v_i2_34 1) v_n_13) (= v_i2_33 (+ 2 v_i2_34))) InVars {i2=v_i2_34, n=v_n_13, f=v_f_19, x2=v_x2_32} OutVars{i2=v_i2_33, n=v_n_13, f=v_f_19, x2=v_x2_31} AuxVars[] AssignedVars[x2, i2]" [2025-04-26 18:39:55,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 74959, now seen corresponding path program 1 times [2025-04-26 18:39:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6878866] [2025-04-26 18:39:55,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:55,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:55,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times [2025-04-26 18:39:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731898462] [2025-04-26 18:39:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2323785, now seen corresponding path program 1 times [2025-04-26 18:39:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492847453] [2025-04-26 18:39:55,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,617 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:55,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:55,617 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:55,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:55,617 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:55,617 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,617 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:55,617 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:55,617 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:55,617 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:55,617 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:55,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,727 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:55,727 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:55,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:39:55,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,747 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:55,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:39:55,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,777 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:55,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:39:55,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:55,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:39:55,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:39:55,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:55,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:55,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:55,862 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:55,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:55,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:55,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:55,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:55,908 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:55,909 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:55,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:55,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:55,915 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:55,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:39:55,931 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:55,931 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:55,931 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 1*n Supporting invariants [] [2025-04-26 18:39:55,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:55,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:55,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:55,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:55,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:55,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:55,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:55,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:55,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:55,966 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:55,966 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:55,983 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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 21 states and 38 transitions. Complement of second has 4 states. [2025-04-26 18:39:55,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 18:39:55,984 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:39:55,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,984 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:39:55,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,984 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:39:55,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:55,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 38 transitions. [2025-04-26 18:39:55,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:55,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2025-04-26 18:39:55,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:55,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:55,985 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:55,986 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:55,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:55,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:55,986 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:55,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:55,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:55,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:55,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:55,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:39:55,997 INFO L201 PluginConnector]: Adding new model unroll-cond-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:55 BoogieIcfgContainer [2025-04-26 18:39:55,997 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:55,998 INFO L158 Benchmark]: Toolchain (without parser) took 1542.80ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.4MB in the beginning and 66.8MB in the end (delta: 16.6MB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. [2025-04-26 18:39:55,998 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:55,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.63ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:55,998 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.7MB in the end (delta: 989.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:55,998 INFO L158 Benchmark]: RCFGBuilder took 164.14ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 70.3MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:55,999 INFO L158 Benchmark]: BuchiAutomizer took 1318.83ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.1MB in the beginning and 66.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:56,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.78ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.63ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 80.7MB in the end (delta: 989.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 164.14ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 70.3MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1318.83ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.1MB in the beginning and 66.8MB in the end (delta: 3.3MB). 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 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital36 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 88ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 109, Number of transitions in reduction automaton: 33, Number of states in reduction automaton: 22, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:56,013 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...