/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/parallel/misc-3-extended.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:08,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:08,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:08,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:08,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:08,123 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:08,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:08,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:08,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:08,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:08,141 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:08,141 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:08,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:08,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:08,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:08,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:08,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:08,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:08,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:08,143 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:08,143 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:08,143 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:08,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:08,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:08,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:08,365 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:08,365 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:08,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3-extended.wvr.bpl [2025-04-26 16:55:08,368 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3-extended.wvr.bpl' [2025-04-26 16:55:08,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:08,386 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:08,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:08,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:08,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:08,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,415 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:08,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:08,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:08,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:08,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:08,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:08,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:08,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:08,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:08,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/1) ... [2025-04-26 16:55:08,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:08,493 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:08,495 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:08,511 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:08,511 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:08,511 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:08,511 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:08,512 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:08,544 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:08,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:08,641 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:08,642 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:08,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:08,653 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:08,654 INFO L201 PluginConnector]: Adding new model misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:08 BoogieIcfgContainer [2025-04-26 16:55:08,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:08,654 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:08,654 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:08,660 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:08,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:08,660 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:08" (1/2) ... [2025-04-26 16:55:08,661 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f7186ba and model type misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:08, skipping insertion in model container [2025-04-26 16:55:08,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:08,661 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:08" (2/2) ... [2025-04-26 16:55:08,662 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-3-extended.wvr.bpl [2025-04-26 16:55:08,703 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:08,736 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:08,740 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:08,741 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:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 53 transitions, 127 flow [2025-04-26 16:55:08,814 INFO L116 PetriNetUnfolderBase]: 12/47 cut-off events. [2025-04-26 16:55:08,816 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:08,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 12/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 108 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2025-04-26 16:55:08,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 53 transitions, 127 flow [2025-04-26 16:55:08,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2025-04-26 16:55:08,823 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 47 transitions, 112 flow [2025-04-26 16:55:08,828 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:08,964 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 411#[L79, L50, L96]true [2025-04-26 16:55:09,145 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1755#[L50, L26, L95, L78]true [2025-04-26 16:55:09,149 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1089#[L55, L26, L95, L78-1]true [2025-04-26 16:55:09,152 WARN L140 AmpleReduction]: Number of pruned transitions: 1779 [2025-04-26 16:55:09,153 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 3 [2025-04-26 16:55:09,154 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 147 [2025-04-26 16:55:09,154 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 16:55:09,154 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:736 [2025-04-26 16:55:09,154 WARN L145 AmpleReduction]: Times succ was already a loop node:56 [2025-04-26 16:55:09,154 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:679 [2025-04-26 16:55:09,154 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:09,161 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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:09,168 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:09,169 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:09,169 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:09,169 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:09,169 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:09,169 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:09,169 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:09,169 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:09,172 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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:09,213 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 889 [2025-04-26 16:55:09,213 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,216 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:09,220 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:09,223 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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:09,236 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 889 [2025-04-26 16:55:09,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,236 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:09,241 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:09,242 INFO L754 eck$LassoCheckResult]: Loop: "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[142] L30-->L30-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:09,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 5193, now seen corresponding path program 1 times [2025-04-26 16:55:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465526958] [2025-04-26 16:55:09,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 156569641, now seen corresponding path program 1 times [2025-04-26 16:55:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782676268] [2025-04-26 16:55:09,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:09,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:09,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:09,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:09,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1524733727, now seen corresponding path program 1 times [2025-04-26 16:55:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854857103] [2025-04-26 16:55:09,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:09,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:09,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,446 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:09,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:09,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:09,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:09,447 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:09,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:09,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:09,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:09,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:09,447 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:09,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,532 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:09,532 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,536 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:09,537 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:09,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:09,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:09,563 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:09,563 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite g1 1 0)_1=1} Honda state: {v_rep(ite g1 1 0)_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:55:09,569 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:09,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,572 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:09,573 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:09,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:09,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:09,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,595 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:09,596 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:09,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:09,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:09,622 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:09,625 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 16:55:09,626 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:09,626 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:09,626 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:09,626 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:09,626 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:09,626 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,626 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:09,626 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:09,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:09,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:09,626 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:09,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:09,658 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:09,661 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,664 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:09,665 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:09,666 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:09,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:09,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:09,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:09,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:09,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:09,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:09,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:09,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:09,689 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 16:55:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,691 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:09,692 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:09,694 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:09,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:09,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:09,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:09,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:09,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:09,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:09,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:09,706 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:09,709 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:09,709 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,712 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:09,713 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:09,714 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:09,717 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:09,718 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:09,718 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:09,718 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_2) = 1*v_rep(ite d1 1 0)_2 Supporting invariants [] [2025-04-26 16:55:09,725 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:09,727 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:09,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:09,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:09,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:09,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:09,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:09,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:09,775 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:09,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:09,823 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:09,836 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:09,839 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:10,019 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4188 states and 8181 transitions. Complement of second has 8 states. [2025-04-26 16:55:10,020 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:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-04-26 16:55:10,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 2 letters. Loop has 5 letters. [2025-04-26 16:55:10,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,031 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 16:55:10,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,031 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 2 letters. Loop has 10 letters. [2025-04-26 16:55:10,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:10,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4188 states and 8181 transitions. [2025-04-26 16:55:10,076 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 1939 [2025-04-26 16:55:10,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4188 states to 3398 states and 6459 transitions. [2025-04-26 16:55:10,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2208 [2025-04-26 16:55:10,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2635 [2025-04-26 16:55:10,125 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3398 states and 6459 transitions. [2025-04-26 16:55:10,125 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:10,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3398 states and 6459 transitions. [2025-04-26 16:55:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states and 6459 transitions. [2025-04-26 16:55:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2333. [2025-04-26 16:55:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 2333 states have (on average 1.989712816116588) internal successors, (in total 4642), 2332 states have internal predecessors, (4642), 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:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4642 transitions. [2025-04-26 16:55:10,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2333 states and 4642 transitions. [2025-04-26 16:55:10,241 INFO L438 stractBuchiCegarLoop]: Abstraction has 2333 states and 4642 transitions. [2025-04-26 16:55:10,241 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:10,241 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2333 states and 4642 transitions. [2025-04-26 16:55:10,265 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 1435 [2025-04-26 16:55:10,265 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:10,266 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:10,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:10,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:10,266 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,266 INFO L754 eck$LassoCheckResult]: Loop: "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[141] L30-->L31: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[144] L31-->L30-1: Formula: (not v_g1_1) InVars {} OutVars{g1=v_g1_1} AuxVars[] AssignedVars[g1]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 4994763, now seen corresponding path program 1 times [2025-04-26 16:55:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330287313] [2025-04-26 16:55:10,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash 676995368, now seen corresponding path program 1 times [2025-04-26 16:55:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078427617] [2025-04-26 16:55:10,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,310 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:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:10,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078427617] [2025-04-26 16:55:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078427617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:10,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233403226] [2025-04-26 16:55:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:10,316 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:55:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:10,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:10,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:10,318 INFO L87 Difference]: Start difference. First operand 2333 states and 4642 transitions. cyclomatic complexity: 2366 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:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:10,364 INFO L93 Difference]: Finished difference Result 2606 states and 4957 transitions. [2025-04-26 16:55:10,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2606 states and 4957 transitions. [2025-04-26 16:55:10,382 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 1435 [2025-04-26 16:55:10,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2606 states to 2507 states and 4805 transitions. [2025-04-26 16:55:10,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1744 [2025-04-26 16:55:10,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1744 [2025-04-26 16:55:10,399 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2507 states and 4805 transitions. [2025-04-26 16:55:10,399 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:10,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2507 states and 4805 transitions. [2025-04-26 16:55:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states and 4805 transitions. [2025-04-26 16:55:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2420. [2025-04-26 16:55:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2420 states have (on average 1.931404958677686) internal successors, (in total 4674), 2419 states have internal predecessors, (4674), 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:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 4674 transitions. [2025-04-26 16:55:10,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2420 states and 4674 transitions. [2025-04-26 16:55:10,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:10,449 INFO L438 stractBuchiCegarLoop]: Abstraction has 2420 states and 4674 transitions. [2025-04-26 16:55:10,449 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:10,449 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2420 states and 4674 transitions. [2025-04-26 16:55:10,459 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 1435 [2025-04-26 16:55:10,459 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:10,460 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:10,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:10,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:10,460 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,460 INFO L754 eck$LassoCheckResult]: Loop: "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[141] L30-->L31: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[143] L31-->L30-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:55:10,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 4994763, now seen corresponding path program 2 times [2025-04-26 16:55:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332308153] [2025-04-26 16:55:10,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:10,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash 676994407, now seen corresponding path program 1 times [2025-04-26 16:55:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834087718] [2025-04-26 16:55:10,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:10,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:10,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:10,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 231773361, now seen corresponding path program 1 times [2025-04-26 16:55:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:10,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99472391] [2025-04-26 16:55:10,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:10,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:10,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:10,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:10,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:10,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99472391] [2025-04-26 16:55:10,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99472391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:10,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:10,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7904002] [2025-04-26 16:55:10,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:10,541 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:10,542 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:10,542 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:10,542 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:10,542 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:10,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:10,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:10,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:10,542 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:10,542 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,569 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,569 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,571 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:10,573 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:10,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,590 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 16:55:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,593 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:10,594 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:10,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:10,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,620 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:55:10,621 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=-3}, {pos=2}, {pos=2}] Lambdas: [1, 0, 1] Nus: [0, 1] [2025-04-26 16:55:10,626 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:10,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,628 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:10,629 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:10,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:10,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,651 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:10,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,653 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:10,654 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:10,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:10,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:10,686 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:10,690 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:10,690 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:10,690 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:10,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:10,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:10,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:10,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:10,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:10,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:55:10,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:10,691 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:10,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:10,725 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:10,725 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,727 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:10,728 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:10,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 16:55:10,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,744 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:10,749 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:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,751 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:10,751 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:10,760 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:10,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:10,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:10,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:10,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:10,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:10,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:10,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:10,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:10,773 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:55:10,773 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:55:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:10,775 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:10,775 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:10,776 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:10,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:10,779 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:10,779 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:10,779 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_4) = -2*v_rep(ite d1 1 0)_4 + 1 Supporting invariants [] [2025-04-26 16:55:10,785 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:10,786 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:10,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:10,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:10,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:10,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:10,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:10,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:10,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:10,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:10,867 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:10,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:55:10,867 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2420 states and 4674 transitions. cyclomatic complexity: 2311 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 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:11,028 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2420 states and 4674 transitions. cyclomatic complexity: 2311. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 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 9389 states and 18492 transitions. Complement of second has 8 states. [2025-04-26 16:55:11,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 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:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-04-26 16:55:11,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 181 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:55:11,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,031 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 181 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:55:11,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,031 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 181 transitions. Stem has 4 letters. Loop has 12 letters. [2025-04-26 16:55:11,031 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:11,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9389 states and 18492 transitions. [2025-04-26 16:55:11,095 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 3010 [2025-04-26 16:55:11,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9389 states to 7789 states and 14860 transitions. [2025-04-26 16:55:11,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3680 [2025-04-26 16:55:11,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4619 [2025-04-26 16:55:11,149 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7789 states and 14860 transitions. [2025-04-26 16:55:11,150 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:11,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7789 states and 14860 transitions. [2025-04-26 16:55:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states and 14860 transitions. [2025-04-26 16:55:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 5829. [2025-04-26 16:55:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5829 states, 5829 states have (on average 1.9523074283753645) internal successors, (in total 11380), 5828 states have internal predecessors, (11380), 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:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5829 states to 5829 states and 11380 transitions. [2025-04-26 16:55:11,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5829 states and 11380 transitions. [2025-04-26 16:55:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:11,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:55:11,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:55:11,299 INFO L87 Difference]: Start difference. First operand 5829 states and 11380 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:11,343 INFO L93 Difference]: Finished difference Result 2624 states and 4286 transitions. [2025-04-26 16:55:11,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2624 states and 4286 transitions. [2025-04-26 16:55:11,355 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 1505 [2025-04-26 16:55:11,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2624 states to 1609 states and 2800 transitions. [2025-04-26 16:55:11,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1607 [2025-04-26 16:55:11,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1609 [2025-04-26 16:55:11,363 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1609 states and 2800 transitions. [2025-04-26 16:55:11,372 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:11,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1609 states and 2800 transitions. [2025-04-26 16:55:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 2800 transitions. [2025-04-26 16:55:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1348. [2025-04-26 16:55:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1348 states have (on average 1.728486646884273) internal successors, (in total 2330), 1347 states have internal predecessors, (2330), 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:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2330 transitions. [2025-04-26 16:55:11,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1348 states and 2330 transitions. [2025-04-26 16:55:11,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:11,456 INFO L438 stractBuchiCegarLoop]: Abstraction has 1348 states and 2330 transitions. [2025-04-26 16:55:11,456 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:11,456 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1348 states and 2330 transitions. [2025-04-26 16:55:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 1253 [2025-04-26 16:55:11,461 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:11,461 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:11,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:11,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:11,461 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:11,462 INFO L754 eck$LassoCheckResult]: Loop: "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[142] L30-->L30-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[137] L21-->L26: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[139] L26-->L21-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[141] L30-->L31: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[143] L31-->L30-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:55:11,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 5193, now seen corresponding path program 2 times [2025-04-26 16:55:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:11,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214133915] [2025-04-26 16:55:11,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:11,470 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:11,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:11,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:11,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:11,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1096952977, now seen corresponding path program 1 times [2025-04-26 16:55:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:11,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017323239] [2025-04-26 16:55:11,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:11,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:11,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:11,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -914374105, now seen corresponding path program 1 times [2025-04-26 16:55:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:11,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916870132] [2025-04-26 16:55:11,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:11,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:11,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:11,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:11,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:11,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:11,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:11,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:11,643 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:11,654 INFO L201 PluginConnector]: Adding new model misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:11 BoogieIcfgContainer [2025-04-26 16:55:11,655 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:11,655 INFO L158 Benchmark]: Toolchain (without parser) took 3269.41ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 90.2MB in the beginning and 119.2MB in the end (delta: -29.1MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2025-04-26 16:55:11,656 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.92ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 114.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:11,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:11,658 INFO L158 Benchmark]: Boogie Preprocessor took 28.65ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 87.3MB in the end (delta: 954.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:11,659 INFO L158 Benchmark]: RCFGBuilder took 207.31ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 77.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:11,659 INFO L158 Benchmark]: BuchiAutomizer took 3000.30ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 77.1MB in the beginning and 119.2MB in the end (delta: -42.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2025-04-26 16:55:11,660 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.92ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 91.1MB in the end (delta: 114.1kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.65ms. Allocated memory is still 163.6MB. Free memory was 88.2MB in the beginning and 87.3MB in the end (delta: 954.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 207.31ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 77.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3000.30ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 77.1MB in the beginning and 119.2MB in the end (delta: -42.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 3373 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 290 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol133 ite100 ukn100 eq150 hnf100 smp100 dnf100 smp100 tf116 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 422, Number of transitions in reduction automaton: 1780, Number of states in reduction automaton: 916, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -2 * (if d1 then 1 else 0) + 1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1348 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 20]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L92] 0 assume pos == 0 && d1 == d2 && d1 == d3 && d1 == g1 && d1 == g2 && d1 == g3 && d1 == true; VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L93] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] Loop: [L20] COND TRUE g1 [L21] COND TRUE d1 [L22] pos := pos + 1; [L29] d1 := !d1; [L30] COND FALSE !(d1) [L20] COND TRUE g1 [L21] COND FALSE !(d1) [L26] pos := pos - 1; [L29] d1 := !d1; [L30] COND TRUE d1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 20]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L92] 0 assume pos == 0 && d1 == d2 && d1 == d3 && d1 == g1 && d1 == g2 && d1 == g3 && d1 == true; VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L93] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] Loop: [L20] COND TRUE g1 [L21] COND TRUE d1 [L22] pos := pos + 1; [L29] d1 := !d1; [L30] COND FALSE !(d1) [L20] COND TRUE g1 [L21] COND FALSE !(d1) [L26] pos := pos - 1; [L29] d1 := !d1; [L30] COND TRUE d1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:55:11,675 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...