/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 /storage/cav23-termute-examples/4_plus_thr/interleaved4-buggy.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:43:43,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:43,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:43,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:43,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:43,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:43:43,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:43,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:43,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:43,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:43,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:43,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:43,282 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:43,282 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:43,282 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:43,282 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:43,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:43,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:43,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:43,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:43,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:43,286 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:43,286 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:43,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:43,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:43,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:43,634 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:43,635 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:43,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/interleaved4-buggy.c.bpl [2025-04-26 18:43:43,638 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/interleaved4-buggy.c.bpl' [2025-04-26 18:43:43,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:43,667 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:43,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:43,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:43,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:43,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,720 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:43,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:43,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:43,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:43,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:43,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,738 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:43,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:43,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:43,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:43,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/1) ... [2025-04-26 18:43:43,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:43,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:43,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:43:43,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:43,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:43,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:43,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:43,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:43,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:43,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:43,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:43,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:43,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:43,843 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:43:43,883 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:43,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:43,993 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:43,993 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:44,014 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:44,014 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:44,015 INFO L201 PluginConnector]: Adding new model interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:44 BoogieIcfgContainer [2025-04-26 18:43:44,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:44,016 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:44,016 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:44,022 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:44,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:44,022 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:43" (1/2) ... [2025-04-26 18:43:44,023 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@696c34b1 and model type interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:44, skipping insertion in model container [2025-04-26 18:43:44,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:44,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:44" (2/2) ... [2025-04-26 18:43:44,025 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved4-buggy.c.bpl [2025-04-26 18:43:44,093 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:43:44,137 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:44,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:44,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:43:44,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 110 flow [2025-04-26 18:43:44,226 INFO L116 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-04-26 18:43:44,229 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:43:44,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-26 18:43:44,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 41 transitions, 110 flow [2025-04-26 18:43:44,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 33 transitions, 90 flow [2025-04-26 18:43:44,241 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 33 transitions, 90 flow [2025-04-26 18:43:44,241 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions, 90 flow [2025-04-26 18:43:44,382 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1557 states, 1556 states have (on average 3.9383033419023135) internal successors, (in total 6128), 1556 states have internal predecessors, (6128), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:44,388 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1557 states, 1556 states have (on average 3.9383033419023135) internal successors, (in total 6128), 1556 states have internal predecessors, (6128), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:44,390 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:43:44,568 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2989#[L52, L76, L61-1, L20]true [2025-04-26 18:43:44,669 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 871#[thread3EXIT, L32, L46, L18]true [2025-04-26 18:43:44,683 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2459#[thread4EXIT, L46-1, L32, L19, L61]true [2025-04-26 18:43:44,698 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1899#[L46-1, L32, L76, L19, L61]true [2025-04-26 18:43:44,699 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3133#[L52, L67, L32, L19, L76-1]true [2025-04-26 18:43:44,703 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 795#[L46-1, L32, L18, L61]true [2025-04-26 18:43:44,704 WARN L140 AmpleReduction]: Number of pruned transitions: 1518 [2025-04-26 18:43:44,704 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 6 [2025-04-26 18:43:44,704 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 156 [2025-04-26 18:43:44,704 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 18:43:44,705 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:661 [2025-04-26 18:43:44,705 WARN L145 AmpleReduction]: Times succ was already a loop node:52 [2025-04-26 18:43:44,705 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:295 [2025-04-26 18:43:44,705 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:43:44,707 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 848 states, 847 states have (on average 1.6824085005903189) internal successors, (in total 1425), 847 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:44,714 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:43:44,714 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:43:44,714 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:43:44,714 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:43:44,714 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:43:44,714 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:43:44,715 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:43:44,715 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:43:44,718 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 847 states have (on average 1.6824085005903189) internal successors, (in total 1425), 847 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 712 [2025-04-26 18:43:44,760 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:44,760 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:44,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:43:44,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:43:44,767 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:43:44,769 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 848 states, 847 states have (on average 1.6824085005903189) internal successors, (in total 1425), 847 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:44,782 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 712 [2025-04-26 18:43:44,782 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:44,782 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:44,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:43:44,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:43:44,789 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[120] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" [2025-04-26 18:43:44,789 INFO L754 eck$LassoCheckResult]: Loop: "[87] L33-1-->L31: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[89] L31-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[90] L32-->L33: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[91] L33-->L33-1: Formula: (and (= v_f1_4 0) (< 0 v_f1_5)) InVars {f1=v_f1_5} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-04-26 18:43:44,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 3592, now seen corresponding path program 1 times [2025-04-26 18:43:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:44,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967037135] [2025-04-26 18:43:44,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:44,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:44,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:44,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:44,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:44,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:44,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:44,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:44,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 3603748, now seen corresponding path program 1 times [2025-04-26 18:43:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:44,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686194027] [2025-04-26 18:43:44,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:44,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:44,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:44,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:44,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:44,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:44,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:44,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:44,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash -974999637, now seen corresponding path program 1 times [2025-04-26 18:43:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:44,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720129098] [2025-04-26 18:43:44,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:44,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:44,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:45,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:43:45,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720129098] [2025-04-26 18:43:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720129098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:43:45,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:43:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:43:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333198672] [2025-04-26 18:43:45,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:43:45,224 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:45,225 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:45,225 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:45,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:45,225 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:45,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:45,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:45,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:45,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:45,225 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:45,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,317 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:45,317 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:45,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:43:45,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:45,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:45,345 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:43:45,345 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:43:45,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:43:45,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:43:45,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:45,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:45,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:43:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:43:45,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:45,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:45,460 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:45,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:43:45,466 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:45,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:45,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:45,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:45,466 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:45,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:45,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:45,466 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:45,466 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:45,466 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:45,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:45,522 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:45,525 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:43:45,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:45,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:45,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:45,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:45,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:45,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:45,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:45,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:45,556 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:43:45,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:43:45,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:45,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:45,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:45,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:45,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:45,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:45,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:45,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:45,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:45,598 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:45,598 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:45,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:45,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:43:45,612 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:45,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:43:45,619 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:45,619 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:45,620 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:43:45,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:43:45,630 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:45,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:45,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:45,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:45,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:45,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:45,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:45,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:45,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:45,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:45,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:45,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:45,758 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 18:43:45,762 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 848 states, 847 states have (on average 1.6824085005903189) internal successors, (in total 1425), 847 states have internal predecessors, (1425), 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.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:45,912 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 848 states, 847 states have (on average 1.6824085005903189) internal successors, (in total 1425), 847 states have internal predecessors, (1425), 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.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1805 states and 3060 transitions. Complement of second has 6 states. [2025-04-26 18:43:45,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 18:43:45,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:43:45,922 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:45,922 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:43:45,922 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:45,922 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:43:45,922 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:45,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1805 states and 3060 transitions. [2025-04-26 18:43:45,943 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 347 [2025-04-26 18:43:45,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1805 states to 1204 states and 1999 transitions. [2025-04-26 18:43:45,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2025-04-26 18:43:45,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 741 [2025-04-26 18:43:45,963 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1204 states and 1999 transitions. [2025-04-26 18:43:45,963 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:45,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1204 states and 1999 transitions. [2025-04-26 18:43:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states and 1999 transitions. [2025-04-26 18:43:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1104. [2025-04-26 18:43:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1104 states have (on average 1.6947463768115942) internal successors, (in total 1871), 1103 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1871 transitions. [2025-04-26 18:43:46,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1104 states and 1871 transitions. [2025-04-26 18:43:46,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:43:46,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:43:46,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:43:46,030 INFO L87 Difference]: Start difference. First operand 1104 states and 1871 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:43:46,052 INFO L93 Difference]: Finished difference Result 480 states and 655 transitions. [2025-04-26 18:43:46,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 655 transitions. [2025-04-26 18:43:46,056 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 259 [2025-04-26 18:43:46,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 308 states and 450 transitions. [2025-04-26 18:43:46,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2025-04-26 18:43:46,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2025-04-26 18:43:46,059 INFO L74 IsDeterministic]: Start isDeterministic. Operand 308 states and 450 transitions. [2025-04-26 18:43:46,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:46,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 450 transitions. [2025-04-26 18:43:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 450 transitions. [2025-04-26 18:43:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-04-26 18:43:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.4610389610389611) internal successors, (in total 450), 307 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 450 transitions. [2025-04-26 18:43:46,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 450 transitions. [2025-04-26 18:43:46,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:43:46,069 INFO L438 stractBuchiCegarLoop]: Abstraction has 308 states and 450 transitions. [2025-04-26 18:43:46,069 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:46,069 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 450 transitions. [2025-04-26 18:43:46,071 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 259 [2025-04-26 18:43:46,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:46,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:46,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:43:46,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:43:46,072 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[120] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[86] L33-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[88] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:43:46,072 INFO L754 eck$LassoCheckResult]: Loop: "[93] L44-->L46: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[95] L46-->L46-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[96] L46-1-->L52: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[97] L52-->L44: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 18:43:46,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 107094757, now seen corresponding path program 1 times [2025-04-26 18:43:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511410858] [2025-04-26 18:43:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:43:46,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:43:46,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:46,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:43:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:43:46,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:46,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 3788452, now seen corresponding path program 1 times [2025-04-26 18:43:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490081830] [2025-04-26 18:43:46,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:46,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:46,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:46,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:46,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:46,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -246947960, now seen corresponding path program 1 times [2025-04-26 18:43:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676234384] [2025-04-26 18:43:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:46,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:46,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:43:46,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676234384] [2025-04-26 18:43:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676234384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:43:46,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:43:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:43:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24048103] [2025-04-26 18:43:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:43:46,154 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:46,154 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:46,154 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:46,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:46,155 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:46,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:46,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:46,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:46,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:46,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:46,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,206 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:46,206 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,211 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:43:46,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:46,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:46,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:43:46,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,233 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:43:46,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:46,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:46,305 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:46,310 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 18:43:46,310 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:46,310 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:46,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:46,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:46,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:46,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:46,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:46,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:46,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:46,311 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:46,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,379 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:46,379 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:43:46,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:46,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:46,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:46,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:46,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:46,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:46,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:46,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:46,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:46,408 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:46,408 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:43:46,412 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:46,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:43:46,416 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:46,416 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:46,416 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:43:46,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:46,425 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:46,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:43:46,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:43:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:46,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:46,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:46,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:46,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:46,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:46,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:46,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:46,512 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 18:43:46,513 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 308 states and 450 transitions. cyclomatic complexity: 189 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,616 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 308 states and 450 transitions. cyclomatic complexity: 189. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 670 states and 1026 transitions. Complement of second has 6 states. [2025-04-26 18:43:46,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 18:43:46,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:43:46,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:43:46,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 18:43:46,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 1026 transitions. [2025-04-26 18:43:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 112 [2025-04-26 18:43:46,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 409 states and 618 transitions. [2025-04-26 18:43:46,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2025-04-26 18:43:46,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2025-04-26 18:43:46,628 INFO L74 IsDeterministic]: Start isDeterministic. Operand 409 states and 618 transitions. [2025-04-26 18:43:46,628 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:46,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 409 states and 618 transitions. [2025-04-26 18:43:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 618 transitions. [2025-04-26 18:43:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 373. [2025-04-26 18:43:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 373 states have (on average 1.522788203753351) internal successors, (in total 568), 372 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2025-04-26 18:43:46,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 373 states and 568 transitions. [2025-04-26 18:43:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:43:46,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:43:46,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:43:46,639 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:43:46,657 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2025-04-26 18:43:46,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 84 transitions. [2025-04-26 18:43:46,657 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 49 [2025-04-26 18:43:46,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 79 transitions. [2025-04-26 18:43:46,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 18:43:46,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:43:46,658 INFO L74 IsDeterministic]: Start isDeterministic. Operand 62 states and 79 transitions. [2025-04-26 18:43:46,658 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:46,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-26 18:43:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 79 transitions. [2025-04-26 18:43:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-26 18:43:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (in total 79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-26 18:43:46,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-26 18:43:46,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:43:46,662 INFO L438 stractBuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-26 18:43:46,662 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:43:46,663 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 79 transitions. [2025-04-26 18:43:46,663 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 49 [2025-04-26 18:43:46,663 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:46,663 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:46,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:46,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:43:46,664 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[120] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[86] L33-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[88] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[92] L44-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L17-->L59: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 18:43:46,664 INFO L754 eck$LassoCheckResult]: Loop: "[99] L59-->L61: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[101] L61-->L61-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[102] L61-1-->L67: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[103] L67-->L59: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" [2025-04-26 18:43:46,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash -700703701, now seen corresponding path program 1 times [2025-04-26 18:43:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985851528] [2025-04-26 18:43:46,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:43:46,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:43:46,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:43:46,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:43:46,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:46,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 3973156, now seen corresponding path program 1 times [2025-04-26 18:43:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220804828] [2025-04-26 18:43:46,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:46,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:46,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:46,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:46,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:46,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:46,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:46,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -447047858, now seen corresponding path program 1 times [2025-04-26 18:43:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:46,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684182796] [2025-04-26 18:43:46,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:46,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:43:46,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:43:46,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:46,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:43:46,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684182796] [2025-04-26 18:43:46,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684182796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:43:46,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:43:46,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:43:46,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741053345] [2025-04-26 18:43:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:43:46,755 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:46,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:46,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:46,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:46,756 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:46,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:46,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:46,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:46,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:46,756 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:46,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,797 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:46,797 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:46,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,803 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:43:46,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:46,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:46,817 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:43:46,818 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f4=1} Honda state: {f4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:43:46,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:43:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:43:46,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:46,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:46,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:43:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,852 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:43:46,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:46,856 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:46,880 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:46,884 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 18:43:46,885 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:46,885 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:46,885 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:46,885 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:46,885 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:46,885 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,885 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:46,885 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:46,885 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:46,885 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:46,885 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:46,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:46,927 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:46,927 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:43:46,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:46,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:46,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:46,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:46,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:46,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:46,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:46,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:46,946 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:43:46,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:43:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:43:46,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:46,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:46,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:46,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:46,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:46,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:46,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:46,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:46,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:46,974 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:46,974 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:46,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:46,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:46,977 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:46,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:43:46,979 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:46,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:43:46,983 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:46,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:46,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 18:43:46,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:43:46,992 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:47,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:43:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:43:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:47,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:47,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:47,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:47,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:47,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:47,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:47,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:47,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:47,063 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,086 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 30. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 120 states and 157 transitions. Complement of second has 4 states. [2025-04-26 18:43:47,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:43:47,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:43:47,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:43:47,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,088 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 18:43:47,088 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 157 transitions. [2025-04-26 18:43:47,089 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 18:43:47,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 50 states and 62 transitions. [2025-04-26 18:43:47,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-04-26 18:43:47,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 18:43:47,089 INFO L74 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2025-04-26 18:43:47,089 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:47,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-04-26 18:43:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2025-04-26 18:43:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-04-26 18:43:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.2291666666666667) internal successors, (in total 59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-04-26 18:43:47,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-04-26 18:43:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:43:47,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:43:47,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:43:47,093 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:43:47,100 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-04-26 18:43:47,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2025-04-26 18:43:47,100 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:43:47,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 26 transitions. [2025-04-26 18:43:47,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 18:43:47,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-04-26 18:43:47,100 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2025-04-26 18:43:47,100 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:47,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-04-26 18:43:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2025-04-26 18:43:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-26 18:43:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (in total 26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-04-26 18:43:47,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-04-26 18:43:47,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:43:47,104 INFO L438 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-04-26 18:43:47,104 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:43:47,104 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-04-26 18:43:47,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:43:47,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:47,104 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:47,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:47,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:43:47,105 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[120] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[86] L33-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[88] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[92] L44-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L17-->L59: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[98] L59-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[100] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L18-->L74: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 18:43:47,105 INFO L754 eck$LassoCheckResult]: Loop: "[105] L74-->L76: Formula: (< v_x4_2 v_z_7) InVars {x4=v_x4_2, z=v_z_7} OutVars{x4=v_x4_2, z=v_z_7} AuxVars[] AssignedVars[]" "[107] L76-->L76-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[108] L76-1-->L74: Formula: (= v_x4_3 (+ v_x4_4 1)) InVars {x4=v_x4_4} OutVars{x4=v_x4_3} AuxVars[] AssignedVars[x4]" [2025-04-26 18:43:47,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1122800536, now seen corresponding path program 1 times [2025-04-26 18:43:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:47,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049912770] [2025-04-26 18:43:47,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:47,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:47,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:47,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:47,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:47,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:47,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:47,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:47,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 134121, now seen corresponding path program 1 times [2025-04-26 18:43:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:47,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897732787] [2025-04-26 18:43:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:47,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:47,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:47,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:47,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:47,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:47,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:47,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:47,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:47,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -145362398, now seen corresponding path program 1 times [2025-04-26 18:43:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:47,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490995456] [2025-04-26 18:43:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:47,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:43:47,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:43:47,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:43:47,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490995456] [2025-04-26 18:43:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490995456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:43:47,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:43:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:43:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112197376] [2025-04-26 18:43:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:43:47,214 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:47,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:47,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:47,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:47,214 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:47,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:47,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:47,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:47,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:47,214 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:47,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:47,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:47,250 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:47,250 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:47,257 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:43:47,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:47,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:47,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:43:47,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:47,282 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:47,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:43:47,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:47,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:47,375 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:47,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:43:47,381 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:47,381 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:47,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:47,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:47,381 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:47,381 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:47,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:47,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4-buggy.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:47,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:47,381 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:47,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:47,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:47,427 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:47,427 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:47,429 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:47,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:43:47,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:47,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:47,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:47,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:47,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:47,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:47,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:47,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:47,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:47,462 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:47,462 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:47,464 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:47,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:43:47,466 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:47,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:43:47,470 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:47,471 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:47,471 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:43:47,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:43:47,477 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:47,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:47,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:47,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:47,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:47,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:47,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:47,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:47,539 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:47,540 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,565 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 36 states and 43 transitions. Complement of second has 6 states. [2025-04-26 18:43:47,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-04-26 18:43:47,566 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:43:47,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,566 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:43:47,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,566 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 18:43:47,566 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:47,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-04-26 18:43:47,567 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:47,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2025-04-26 18:43:47,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:43:47,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:43:47,567 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:43:47,567 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:47,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:47,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:47,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:43:47,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:43:47,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:43:47,568 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:43:47,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:47,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:43:47,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:43:47,568 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:47,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:47,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:43:47,569 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:47,569 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:43:47,569 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:43:47,569 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:47,569 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:43:47,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:43:47,588 INFO L201 PluginConnector]: Adding new model interleaved4-buggy.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:43:47 BoogieIcfgContainer [2025-04-26 18:43:47,588 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:43:47,589 INFO L158 Benchmark]: Toolchain (without parser) took 3921.78ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 51.9MB in the end (delta: 32.8MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2025-04-26 18:43:47,589 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.07ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 85.6MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:47,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.47ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:47,589 INFO L158 Benchmark]: Boogie Preprocessor took 42.03ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:47,590 INFO L158 Benchmark]: RCFGBuilder took 249.26ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 71.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:43:47,590 INFO L158 Benchmark]: BuchiAutomizer took 3572.21ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 51.9MB in the end (delta: 18.9MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2025-04-26 18:43:47,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.07ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 85.6MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.47ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 42.03ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 249.26ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 71.0MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3572.21ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 51.9MB in the end (delta: 18.9MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 138 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 101 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT4 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 574, Number of transitions in reduction automaton: 1425, Number of states in reduction automaton: 848, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function f3 and consists of 3 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:43:47,607 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...