/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:39,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:39,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:39,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:39,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:39,598 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:39,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:39,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:39,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:39,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:39,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:39,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:39,616 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:39,616 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:39,616 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:39,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:39,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:39,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:39,618 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:39,618 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:39,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:39,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:39,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:39,848 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:39,848 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:39,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl [2025-04-26 18:40:39,850 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl' [2025-04-26 18:40:39,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:39,868 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:39,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:39,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:39,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,909 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:39,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:39,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:39,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:39,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:39,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:39,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,961 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:39,966 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:39,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:39,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:39,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:39,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:39,986 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:40,021 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:40,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:40,131 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:40,131 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:40,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:40,141 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:40,141 INFO L201 PluginConnector]: Adding new model misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40 BoogieIcfgContainer [2025-04-26 18:40:40,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:40,142 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:40,142 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:40,150 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:40,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,151 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/2) ... [2025-04-26 18:40:40,152 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52b5e33d and model type misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:40, skipping insertion in model container [2025-04-26 18:40:40,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,152 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40" (2/2) ... [2025-04-26 18:40:40,153 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-3.wvr.bpl [2025-04-26 18:40:40,200 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:40,240 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:40,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:40,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,242 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:40,247 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:40,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 88 flow [2025-04-26 18:40:40,319 INFO L116 PetriNetUnfolderBase]: 8/33 cut-off events. [2025-04-26 18:40:40,320 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:40,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 8/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2025-04-26 18:40:40,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 88 flow [2025-04-26 18:40:40,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 78 flow [2025-04-26 18:40:40,326 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 33 transitions, 78 flow [2025-04-26 18:40:40,326 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 33 transitions, 78 flow [2025-04-26 18:40:40,345 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 106 states, 104 states have (on average 2.548076923076923) internal successors, (in total 265), 105 states have internal predecessors, (265), 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:40,346 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 106 states, 104 states have (on average 2.548076923076923) internal successors, (in total 265), 105 states have internal predecessors, (265), 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:40,350 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:40,450 WARN L140 AmpleReduction]: Number of pruned transitions: 90 [2025-04-26 18:40:40,450 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:40,450 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13 [2025-04-26 18:40:40,450 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 18:40:40,450 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:67 [2025-04-26 18:40:40,450 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 18:40:40,454 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:52 [2025-04-26 18:40:40,454 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:40,455 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 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:40,463 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:40,463 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:40,463 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:40,463 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:40,464 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:40,464 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:40,464 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:40,464 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:40,466 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 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:40,481 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 91 [2025-04-26 18:40:40,482 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,482 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,485 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:40,486 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 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:40,489 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 91 [2025-04-26 18:40:40,489 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,489 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,493 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L67: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0))) InVars {pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} OutVars{pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} AuxVars[] AssignedVars[]" "[118] L67-->L28-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:40,494 INFO L754 eck$LassoCheckResult]: Loop: "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[96] L19-->L24: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[98] L24-->L19-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[101] L28-->L28-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:40,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 3714, now seen corresponding path program 1 times [2025-04-26 18:40:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875510067] [2025-04-26 18:40:40,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 117473888, now seen corresponding path program 1 times [2025-04-26 18:40:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847508198] [2025-04-26 18:40:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,628 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:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:40,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847508198] [2025-04-26 18:40:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847508198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:40,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420967240] [2025-04-26 18:40:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:40,637 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:40:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:40,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:40,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:40,695 INFO L87 Difference]: Start difference. First operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 4 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:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:40,789 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2025-04-26 18:40:40,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 258 transitions. [2025-04-26 18:40:40,793 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 152 [2025-04-26 18:40:40,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 158 states and 232 transitions. [2025-04-26 18:40:40,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2025-04-26 18:40:40,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2025-04-26 18:40:40,800 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 232 transitions. [2025-04-26 18:40:40,801 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:40,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 232 transitions. [2025-04-26 18:40:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 232 transitions. [2025-04-26 18:40:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2025-04-26 18:40:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.4666666666666666) internal successors, (in total 198), 134 states have internal predecessors, (198), 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:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-04-26 18:40:40,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-04-26 18:40:40,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:40,870 INFO L438 stractBuchiCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-04-26 18:40:40,870 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:40,870 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 198 transitions. [2025-04-26 18:40:40,873 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 131 [2025-04-26 18:40:40,874 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,874 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:40,875 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L67: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0))) InVars {pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} OutVars{pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} AuxVars[] AssignedVars[]" "[118] L67-->L28-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:40,875 INFO L754 eck$LassoCheckResult]: Loop: "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[95] L19-->L20: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[97] L20-->L19-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[101] L28-->L28-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[96] L19-->L24: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[98] L24-->L19-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[100] L28-->L29: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[102] L29-->L28-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:40:40,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 3714, now seen corresponding path program 2 times [2025-04-26 18:40:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892908310] [2025-04-26 18:40:40,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:40,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1559697178, now seen corresponding path program 1 times [2025-04-26 18:40:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698072537] [2025-04-26 18:40:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:40,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:40,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:40,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:40,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 983068613, now seen corresponding path program 1 times [2025-04-26 18:40:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549039846] [2025-04-26 18:40:40,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:40,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:40,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:40,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:40:41,142 INFO L201 PluginConnector]: Adding new model misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:41 BoogieIcfgContainer [2025-04-26 18:40:41,142 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:41,143 INFO L158 Benchmark]: Toolchain (without parser) took 1274.21ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 94.4MB in the beginning and 96.0MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,143 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,143 INFO L158 Benchmark]: Boogie Preprocessor took 24.35ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,143 INFO L158 Benchmark]: RCFGBuilder took 204.21ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 82.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,144 INFO L158 Benchmark]: BuchiAutomizer took 1000.30ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.0MB in the beginning and 96.0MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,147 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.20ms. Allocated memory is still 167.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.35ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.5MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 204.21ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 82.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1000.30ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.0MB in the beginning and 96.0MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 39 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 219, Number of transitions in reduction automaton: 175, Number of states in reduction automaton: 106, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 135 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L66] 0 assume pos == 0 && d1 == d2 && d1 == g1 && d1 == g2 && d1 == true; VAL [d1=true, d2=true, g1=true, g2=true, pos=0] [L67] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, g1=true, g2=true, pos=0] Loop: [L18] COND TRUE g1 [L19] COND TRUE d1 [L20] pos := pos + 1; [L27] d1 := !d1; [L28] COND FALSE !(d1) [L18] COND TRUE g1 [L19] COND FALSE !(d1) [L24] pos := pos - 1; [L27] d1 := !d1; [L28] COND TRUE d1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L66] 0 assume pos == 0 && d1 == d2 && d1 == g1 && d1 == g2 && d1 == true; VAL [d1=true, d2=true, g1=true, g2=true, pos=0] [L67] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, g1=true, g2=true, pos=0] Loop: [L18] COND TRUE g1 [L19] COND TRUE d1 [L20] pos := pos + 1; [L27] d1 := !d1; [L28] COND FALSE !(d1) [L18] COND TRUE g1 [L19] COND FALSE !(d1) [L24] pos := pos - 1; [L27] d1 := !d1; [L28] COND TRUE d1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:41,161 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...