/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:20,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:20,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:20,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:20,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:20,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:20,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:20,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:20,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:20,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:20,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:20,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:20,370 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:20,370 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:20,370 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:20,371 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:20,371 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:20,372 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:20,372 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:20,372 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:20,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:20,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:20,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:20,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:20,374 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:20,374 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:20,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:20,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:20,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:20,664 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:20,665 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:20,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl [2025-04-26 18:40:20,668 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl' [2025-04-26 18:40:20,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:20,695 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:20,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:20,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:20,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:20,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,733 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:20,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:20,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:20,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:20,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:20,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:20,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:20,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:20,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:20,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/1) ... [2025-04-26 18:40:20,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:20,794 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:40:20,798 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:40:20,821 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:20,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:20,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:20,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:20,823 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:40:20,868 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:20,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:20,992 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:20,992 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:21,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:21,053 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:21,053 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:21 BoogieIcfgContainer [2025-04-26 18:40:21,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:21,054 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:21,054 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:21,058 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:21,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:21,059 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:20" (1/2) ... [2025-04-26 18:40:21,060 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f73dfa and model type name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:21, skipping insertion in model container [2025-04-26 18:40:21,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:21,060 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:21" (2/2) ... [2025-04-26 18:40:21,061 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-trans.wvr.bpl [2025-04-26 18:40:21,118 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:21,157 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:21,160 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:40:21,163 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:40:21,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:21,242 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 18:40:21,244 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:21,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:40:21,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:21,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:21,250 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:21,251 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:21,272 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:40:21,274 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:40:21,275 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:21,305 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199#[thread2EXIT, thread1EXIT, L109, L88]true [2025-04-26 18:40:21,317 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 219#[L88, L110, thread2EXIT]true [2025-04-26 18:40:21,317 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85#[L108, L62, thread1EXIT]true [2025-04-26 18:40:21,318 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread2FINAL, thread1EXIT, L109, L88]true [2025-04-26 18:40:21,319 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[thread2FINAL, L110, L88]true [2025-04-26 18:40:21,319 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[thread1EXIT, L109, L62, L88]true [2025-04-26 18:40:21,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[thread1EXIT, L109, L62, thread3FINAL]true [2025-04-26 18:40:21,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[thread1EXIT, L109, L62, thread3EXIT]true [2025-04-26 18:40:21,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[thread3FINAL, L62, L110]true [2025-04-26 18:40:21,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[L88, L62, L110]true [2025-04-26 18:40:21,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[L107, L36]true [2025-04-26 18:40:21,322 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[L108, L62, thread1FINAL]true [2025-04-26 18:40:21,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[thread2FINAL, L109, thread1FINAL, L88]true [2025-04-26 18:40:21,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 123#[L109, L62, thread1FINAL, L88]true [2025-04-26 18:40:21,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 157#[L109, thread1FINAL, L62, thread3FINAL]true [2025-04-26 18:40:21,324 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189#[L109, L62, thread1FINAL, thread3EXIT]true [2025-04-26 18:40:21,325 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[L108, L36, L62]true [2025-04-26 18:40:21,325 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 71#[L36, L108, thread2FINAL]true [2025-04-26 18:40:21,325 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 95#[L108, L36, thread2EXIT]true [2025-04-26 18:40:21,326 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185#[thread2EXIT, L109, thread1FINAL, L88]true [2025-04-26 18:40:21,326 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161#[thread2EXIT, L109, L88, L36]true [2025-04-26 18:40:21,327 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[thread2EXIT, L109, thread3FINAL, L36]true [2025-04-26 18:40:21,328 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 129#[thread2FINAL, L109, L88, L36]true [2025-04-26 18:40:21,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 163#[thread2FINAL, L109, thread3FINAL, L36]true [2025-04-26 18:40:21,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193#[thread2FINAL, L109, thread3EXIT, L36]true [2025-04-26 18:40:21,330 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99#[L109, L62, L88, L36]true [2025-04-26 18:40:21,330 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[L109, L62, thread3FINAL, L36]true [2025-04-26 18:40:21,330 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 165#[L109, L62, thread3EXIT, L36]true [2025-04-26 18:40:21,330 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 18:40:21,330 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 18:40:21,331 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 18:40:21,331 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:21,331 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 18:40:21,331 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:21,331 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:21,331 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:21,331 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:21,336 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:21,337 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:21,337 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:21,337 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:21,337 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:21,337 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:21,337 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:21,337 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:21,338 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:21,349 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:21,349 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:21,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:21,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:21,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:21,353 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:21,354 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:21,359 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:21,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:21,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:21,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:21,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:21,365 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" [2025-04-26 18:40:21,366 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-->L36: Formula: (let ((.cse3 (= v_name_2_29 v_current_6_16)) (.cse1 (not v_break_7_64))) (let ((.cse4 (and .cse3 .cse1)) (.cse0 (= v_name_1_25 v_current_6_16)) (.cse2 (not v_break_7_53))) (and (= v_current_6_16 (select v_nondet_0_6 v_i_5_32)) (< v_i_5_32 3) (= v_i_5_31 (+ v_i_5_32 1)) (or (and (or .cse0 v_break_7_53) v_break_7_64) (and (not .cse0) .cse1 .cse2)) (or (and (not v_break_7_52) (or v_break_7_64 (not .cse3)) .cse1) (and (or v_break_7_64 .cse4) v_break_7_52)) (= v_result_4_44 (ite .cse4 (- 1) (ite .cse0 1 v_result_4_45))) .cse2))) InVars {name_2=v_name_2_29, i_5=v_i_5_32, nondet_0=v_nondet_0_6, result_4=v_result_4_45, break_7=v_break_7_53, name_1=v_name_1_25} OutVars{name_2=v_name_2_29, i_5=v_i_5_31, result_4=v_result_4_44, break_7=v_break_7_52, current_6=v_current_6_16, name_1=v_name_1_25, nondet_0=v_nondet_0_6} AuxVars[v_break_7_64] AssignedVars[i_5, result_4, break_7, current_6]" [2025-04-26 18:40:21,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2025-04-26 18:40:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360980862] [2025-04-26 18:40:21,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:21,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:21,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:21,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:21,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:21,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 18:40:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390448379] [2025-04-26 18:40:21,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:21,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:21,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:21,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:21,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:21,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2025-04-26 18:40:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:21,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37776514] [2025-04-26 18:40:21,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:21,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:21,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:21,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:22,052 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:22,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:22,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:22,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:22,053 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:22,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:22,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:22,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:22,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:22,054 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:22,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:22,278 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:22,609 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:22,611 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,614 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:40:22,616 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:40:22,618 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:40:22,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:22,631 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 18:40:22,631 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 18:40:22,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:22,741 INFO L402 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2025-04-26 18:40:22,742 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 18:40:22,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:22,916 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:40:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,918 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:40:22,947 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:40:22,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:22,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:22,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:22,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:22,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:22,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:22,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:22,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:22,992 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:40:22,992 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:40:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:22,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,996 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:40:22,997 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:40:22,998 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:23,013 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:40:23,013 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:23,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:23,014 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2025-04-26 18:40:23,019 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:40:23,022 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:23,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:23,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:23,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:23,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:23,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:23,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:23,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:23,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:23,075 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:40:23,120 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:23,121 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:23,189 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 167 states and 409 transitions. Complement of second has 5 states. [2025-04-26 18:40:23,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 18:40:23,202 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:23,203 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:23,203 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:23,203 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:23,203 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:23,203 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:23,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 18:40:23,211 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:23,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 18:40:23,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:40:23,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:40:23,221 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 18:40:23,221 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:23,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 18:40:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 18:40:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 18:40:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.5625) internal successors, (in total 164), 63 states have internal predecessors, (164), 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:40:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 18:40:23,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:23,243 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:23,243 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:23,243 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 18:40:23,245 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:23,245 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:23,245 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:23,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:23,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:23,245 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" "[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (= v_name_3_15 v_name_2_39)) (.cse1 (not v_break_11_52))) (and (or (and (not .cse0) (not v_break_11_22) .cse1) (and v_break_11_22 (or .cse0 v_break_11_52))) (= v_i_9_11 0) (= v_result_8_26 (ite .cse0 0 v_result_8_27)) .cse1)) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_2=v_name_2_39} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, name_2=v_name_2_39, break_11=v_break_11_22, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" [2025-04-26 18:40:23,246 INFO L754 eck$LassoCheckResult]: Loop: "[122] L62-->L62: Formula: (let ((.cse1 (not v_break_11_54)) (.cse2 (= v_name_3_25 v_current_10_16))) (let ((.cse0 (and .cse1 .cse2)) (.cse4 (= v_name_2_45 v_current_10_16)) (.cse3 (not v_break_11_43))) (and (= v_i_9_27 (+ v_i_9_28 1)) (< v_i_9_28 3) (or (and (or .cse0 v_break_11_54) v_break_11_42) (and (not v_break_11_42) .cse1 (or (not .cse2) v_break_11_54))) (= v_current_10_16 (select v_nondet_0_12 v_i_9_28)) .cse3 (= v_result_8_42 (ite .cse0 (- 1) (ite .cse4 1 v_result_8_44))) (or (and (or .cse4 v_break_11_43) v_break_11_54) (and .cse1 (not .cse4) .cse3))))) InVars {name_3=v_name_3_25, result_8=v_result_8_44, name_2=v_name_2_45, break_11=v_break_11_43, nondet_0=v_nondet_0_12, i_9=v_i_9_28} OutVars{name_3=v_name_3_25, result_8=v_result_8_42, name_2=v_name_2_45, break_11=v_break_11_42, current_10=v_current_10_16, nondet_0=v_nondet_0_12, i_9=v_i_9_27} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9]" [2025-04-26 18:40:23,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,246 INFO L85 PathProgramCache]: Analyzing trace with hash 4912070, now seen corresponding path program 1 times [2025-04-26 18:40:23,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259560972] [2025-04-26 18:40:23,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:23,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:23,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:23,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:23,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2025-04-26 18:40:23,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648063149] [2025-04-26 18:40:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:23,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:23,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:23,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:23,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 152274292, now seen corresponding path program 1 times [2025-04-26 18:40:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306127754] [2025-04-26 18:40:23,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:23,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:23,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,653 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:23,653 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:23,653 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:23,653 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:23,653 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:23,653 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:23,653 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:23,653 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:23,653 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:23,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:23,654 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:23,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,887 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 18:40:23,892 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:24,363 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:24,363 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,365 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:40:24,375 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:40:24,376 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:40:24,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:24,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:24,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:24,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:24,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:24,395 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:40:24,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,397 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:40:24,398 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:40:24,400 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:40:24,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:24,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:24,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:24,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:24,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:24,419 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:40:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,421 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:40:24,423 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:40:24,423 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:40:24,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,434 INFO L203 nArgumentSynthesizer]: 9 stem disjuncts [2025-04-26 18:40:24,434 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 18:40:24,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,549 INFO L402 nArgumentSynthesizer]: We have 238 Motzkin's Theorem applications. [2025-04-26 18:40:24,549 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 18:40:24,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:24,802 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:40:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,804 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:40:24,805 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:40:24,806 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:40:24,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:24,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:24,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:24,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:24,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:24,826 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:40:24,826 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:24,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,828 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:40:24,844 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:40:24,844 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:24,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:24,863 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:24,863 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:24,864 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2025-04-26 18:40:24,869 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:40:24,870 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:24,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:24,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:24,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:24,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:24,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:24,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:24,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:24,904 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:40:24,905 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:24,905 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:40:24,941 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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 177 states and 468 transitions. Complement of second has 4 states. [2025-04-26 18:40:24,941 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:40:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:40:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 18:40:24,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:24,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:24,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:24,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 18:40:24,944 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:24,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 18:40:24,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 18:40:24,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:40:24,946 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 18:40:24,946 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:24,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 18:40:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 18:40:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 18:40:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (in total 206), 76 states have internal predecessors, (206), 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:40:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 18:40:24,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:24,952 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:24,953 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:24,953 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 18:40:24,954 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:24,955 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:24,955 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:24,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:24,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:24,955 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" "[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (= v_name_3_15 v_name_2_39)) (.cse1 (not v_break_11_52))) (and (or (and (not .cse0) (not v_break_11_22) .cse1) (and v_break_11_22 (or .cse0 v_break_11_52))) (= v_i_9_11 0) (= v_result_8_26 (ite .cse0 0 v_result_8_27)) .cse1)) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_2=v_name_2_39} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, name_2=v_name_2_39, break_11=v_break_11_22, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" "[136] L108-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] $Ultimate##0-->L88: Formula: (let ((.cse1 (not v_break_15_62)) (.cse0 (= v_name_3_43 v_name_1_39))) (and (or (and (or v_break_15_62 .cse0) v_break_15_52) (and (not .cse0) .cse1 (not v_break_15_52))) .cse1 (= v_result_12_40 (ite .cse0 0 v_result_12_41)) (= v_i_13_31 0))) InVars {name_3=v_name_3_43, result_12=v_result_12_41, name_1=v_name_1_39} OutVars{name_3=v_name_3_43, result_12=v_result_12_40, i_13=v_i_13_31, name_1=v_name_1_39, break_15=v_break_15_52} AuxVars[v_break_15_62] AssignedVars[result_12, i_13, break_15]" [2025-04-26 18:40:24,955 INFO L754 eck$LassoCheckResult]: Loop: "[125] L88-->L88: Formula: (let ((.cse1 (not v_break_15_64)) (.cse2 (= v_name_3_37 v_current_14_16))) (let ((.cse3 (and .cse1 .cse2)) (.cse0 (not v_break_15_39)) (.cse4 (= v_name_1_33 v_current_14_16))) (and (< v_i_13_28 3) .cse0 (or (and (not v_break_15_38) .cse1 (or (not .cse2) v_break_15_64)) (and (or v_break_15_64 .cse3) v_break_15_38)) (= v_result_12_28 (ite .cse3 (- 1) (ite .cse4 1 v_result_12_29))) (= (+ v_i_13_28 1) v_i_13_27) (or (and .cse0 (not .cse4) .cse1) (and v_break_15_64 (or v_break_15_39 .cse4))) (= v_current_14_16 (select v_nondet_0_16 v_i_13_28))))) InVars {name_3=v_name_3_37, result_12=v_result_12_29, i_13=v_i_13_28, nondet_0=v_nondet_0_16, name_1=v_name_1_33, break_15=v_break_15_39} OutVars{name_3=v_name_3_37, result_12=v_result_12_28, current_14=v_current_14_16, name_1=v_name_1_33, i_13=v_i_13_27, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_64] AssignedVars[result_12, current_14, i_13, break_15]" [2025-04-26 18:40:24,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,956 INFO L85 PathProgramCache]: Analyzing trace with hash 425536314, now seen corresponding path program 1 times [2025-04-26 18:40:24,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086721049] [2025-04-26 18:40:24,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:24,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:24,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:24,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:24,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2025-04-26 18:40:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790500048] [2025-04-26 18:40:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:24,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 306723971, now seen corresponding path program 1 times [2025-04-26 18:40:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174078142] [2025-04-26 18:40:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:25,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:25,369 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:25,369 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:25,369 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:25,369 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:25,369 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:25,369 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,369 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:25,369 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:25,369 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:25,369 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:25,369 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:25,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,612 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2025-04-26 18:40:25,701 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:27,371 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:27,371 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:27,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,373 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:40:27,375 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:40:27,376 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:40:27,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,387 INFO L203 nArgumentSynthesizer]: 13 stem disjuncts [2025-04-26 18:40:27,387 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 18:40:27,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,538 INFO L402 nArgumentSynthesizer]: We have 294 Motzkin's Theorem applications. [2025-04-26 18:40:27,538 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 18:40:27,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,881 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:40:27,882 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:40:27,883 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:40:27,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:27,903 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:27,903 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:27,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,905 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:40:27,905 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:40:27,906 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:27,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,921 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:27,921 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:27,921 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2025-04-26 18:40:27,926 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:40:27,927 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:27,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:27,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:27,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:27,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:27,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,955 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:40:27,955 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:27,955 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,986 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 148 states and 380 transitions. Complement of second has 4 states. [2025-04-26 18:40:27,987 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:40:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:40:27,987 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:27,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:27,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:27,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 18:40:27,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:27,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:27,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:27,990 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:27,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:27,990 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:27,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:27,990 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:28,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:28,004 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:28 BoogieIcfgContainer [2025-04-26 18:40:28,004 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:28,005 INFO L158 Benchmark]: Toolchain (without parser) took 7309.30ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 86.3MB in the beginning and 130.2MB in the end (delta: -43.9MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,006 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:28,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:28,009 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,009 INFO L158 Benchmark]: RCFGBuilder took 287.85ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 65.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,009 INFO L158 Benchmark]: BuchiAutomizer took 6949.59ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 65.2MB in the beginning and 130.2MB in the end (delta: -65.1MB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:28,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 287.85ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 65.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 6949.59ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 65.2MB in the beginning and 130.2MB in the end (delta: -65.1MB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp196 ukn48 mio100 lsp90 div100 bol112 ite100 ukn100 eq176 hnf99 smp100 dnf1546 smp21 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 496ms VariablesStem: 12 VariablesLoop: 8 DisjunctsStem: 13 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 294 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 178, Number of transitions in reduction automaton: 138, Number of states in reduction automaton: 66, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * i_13 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:28,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...