/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/regression/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:18,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:18,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:18,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:18,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:18,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:18,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:18,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:18,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:18,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:18,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:18,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:18,192 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:18,193 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:18,193 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:18,193 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:18,193 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:18,193 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:18,193 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:18,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:18,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:18,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:18,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:18,195 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:18,195 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:18,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:18,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:18,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:18,431 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:18,431 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:18,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl [2025-04-26 18:38:18,432 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl' [2025-04-26 18:38:18,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:18,450 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:18,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:18,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:18,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:18,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,481 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:18,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:18,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:18,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:18,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:18,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:18,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:18,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:18,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:18,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/1) ... [2025-04-26 18:38:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:18,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:18,534 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:38:18,537 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:38:18,560 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:18,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:18,560 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 18:38:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 18:38:18,560 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 18:38:18,561 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:38:18,592 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:18,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:18,658 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:18,659 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:18,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:18,666 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:38:18,667 INFO L201 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:18 BoogieIcfgContainer [2025-04-26 18:38:18,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:18,668 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:18,668 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:18,672 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:18,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:18,673 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:18" (1/2) ... [2025-04-26 18:38:18,674 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28c9a63a and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:18, skipping insertion in model container [2025-04-26 18:38:18,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:18,674 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:18" (2/2) ... [2025-04-26 18:38:18,675 INFO L376 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2025-04-26 18:38:18,711 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 18:38:18,747 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:18,751 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:38:18,752 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:38:18,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 18:38:18,820 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-26 18:38:18,822 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 18:38:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 19 events. 2/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2025-04-26 18:38:18,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 18:38:18,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 39 flow [2025-04-26 18:38:18,829 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 17 places, 16 transitions, 39 flow [2025-04-26 18:38:18,829 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 16 transitions, 39 flow [2025-04-26 18:38:18,839 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 48 states, 44 states have (on average 1.9090909090909092) internal successors, (in total 84), 47 states have internal predecessors, (84), 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:38:18,840 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 48 states, 44 states have (on average 1.9090909090909092) internal successors, (in total 84), 47 states have internal predecessors, (84), 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:38:18,841 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:18,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 104#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL]true [2025-04-26 18:38:18,902 WARN L140 AmpleReduction]: Number of pruned transitions: 13 [2025-04-26 18:38:18,903 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:18,903 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:18,903 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:33 [2025-04-26 18:38:18,903 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 18:38:18,903 WARN L145 AmpleReduction]: Times succ was already a loop node:1 [2025-04-26 18:38:18,903 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:18,903 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:18,904 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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:38:18,909 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:18,909 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:18,909 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:18,909 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:18,909 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:18,909 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:18,909 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:18,909 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:18,910 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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:38:18,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 18:38:18,921 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:18,921 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:18,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:18,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:18,924 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:18,924 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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:38:18,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 18:38:18,926 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:18,926 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:18,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:18,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:18,929 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 18:38:18,930 INFO L754 eck$LassoCheckResult]: Loop: "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[33] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[38] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[39] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[40] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[44] workerEXIT-->L21-2: Formula: (= v_i_13 (+ v_workerThread1of1ForFork0_thidvar0_4 1)) InVars {workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 18:38:18,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1948, now seen corresponding path program 1 times [2025-04-26 18:38:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:18,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688427522] [2025-04-26 18:38:18,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:18,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:18,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:18,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:18,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:18,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:18,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:18,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:18,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 408741230, now seen corresponding path program 1 times [2025-04-26 18:38:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920990703] [2025-04-26 18:38:19,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:19,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:19,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:19,098 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:38:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:19,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920990703] [2025-04-26 18:38:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920990703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070092656] [2025-04-26 18:38:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:19,107 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:19,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:19,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:19,168 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.6341463414634145) internal successors, (in total 67), 44 states have internal predecessors, (67), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 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:38:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:19,210 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2025-04-26 18:38:19,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 50 transitions. [2025-04-26 18:38:19,214 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 18:38:19,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 40 transitions. [2025-04-26 18:38:19,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 18:38:19,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 18:38:19,233 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27 states and 40 transitions. [2025-04-26 18:38:19,234 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:19,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 18:38:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 40 transitions. [2025-04-26 18:38:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-26 18:38:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (in total 40), 26 states have internal predecessors, (40), 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:38:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2025-04-26 18:38:19,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 18:38:19,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:19,274 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-04-26 18:38:19,275 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:19,275 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2025-04-26 18:38:19,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 18:38:19,285 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:19,285 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:19,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:19,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:19,290 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[37] L30-->workerErr0ASSERT_VIOLATIONASSERT: Formula: (< (* 2 v_i_7) v_c_4) InVars {i=v_i_7, c=v_c_4} OutVars{i=v_i_7, c=v_c_4} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:19,290 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:19,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -751207397, now seen corresponding path program 1 times [2025-04-26 18:38:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229293587] [2025-04-26 18:38:19,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:19,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:19,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:19,363 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:38:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:19,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229293587] [2025-04-26 18:38:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229293587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119953182] [2025-04-26 18:38:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:19,364 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:19,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-04-26 18:38:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824356487] [2025-04-26 18:38:19,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:19,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:38:19,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:38:19,376 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. cyclomatic complexity: 16 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (in total 8), 5 states have internal predecessors, (8), 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:38:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:19,475 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-04-26 18:38:19,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 63 transitions. [2025-04-26 18:38:19,476 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 18:38:19,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 63 transitions. [2025-04-26 18:38:19,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:38:19,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-04-26 18:38:19,477 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2025-04-26 18:38:19,477 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:19,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2025-04-26 18:38:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2025-04-26 18:38:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2025-04-26 18:38:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (in total 43), 28 states have internal predecessors, (43), 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:38:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2025-04-26 18:38:19,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 18:38:19,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:38:19,482 INFO L438 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 18:38:19,482 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:19,482 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2025-04-26 18:38:19,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 18:38:19,482 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:19,482 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:19,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:19,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:19,483 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[37] L30-->workerErr0ASSERT_VIOLATIONASSERT: Formula: (< (* 2 v_i_7) v_c_4) InVars {i=v_i_7, c=v_c_4} OutVars{i=v_i_7, c=v_c_4} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:19,483 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:19,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -751092077, now seen corresponding path program 2 times [2025-04-26 18:38:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416640520] [2025-04-26 18:38:19,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:19,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:19,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:19,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:19,531 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:38:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:19,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416640520] [2025-04-26 18:38:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416640520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475164011] [2025-04-26 18:38:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:19,533 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:19,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2025-04-26 18:38:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930844712] [2025-04-26 18:38:19,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:19,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:19,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:38:19,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:38:19,543 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (in total 8), 5 states have internal predecessors, (8), 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:38:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:19,627 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2025-04-26 18:38:19,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2025-04-26 18:38:19,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:19,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 48 transitions. [2025-04-26 18:38:19,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-04-26 18:38:19,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-04-26 18:38:19,629 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2025-04-26 18:38:19,629 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:19,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2025-04-26 18:38:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2025-04-26 18:38:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2025-04-26 18:38:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (in total 32), 22 states have internal predecessors, (32), 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:38:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-04-26 18:38:19,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-04-26 18:38:19,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 18:38:19,632 INFO L438 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-04-26 18:38:19,632 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:19,632 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2025-04-26 18:38:19,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:19,632 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:19,632 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:19,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:19,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:19,633 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[26] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0]" "[34] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" "[32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[38] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[39] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" [2025-04-26 18:38:19,633 INFO L754 eck$LassoCheckResult]: Loop: "[42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:19,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1812591827, now seen corresponding path program 1 times [2025-04-26 18:38:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295390624] [2025-04-26 18:38:19,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:19,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:19,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:19,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:19,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2025-04-26 18:38:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50775850] [2025-04-26 18:38:19,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:38:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:38:19,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:19,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:19,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -355771747, now seen corresponding path program 1 times [2025-04-26 18:38:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646167776] [2025-04-26 18:38:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:19,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:19,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:19,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:19,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:19,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,755 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:19,759 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:38:19,768 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:38:19,769 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:19,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:19,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:19,772 INFO L229 MonitoredProcess]: Starting monitored process 3 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:38:19,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 18:38:19,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 18:38:19,791 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 18:38:19,792 INFO L117 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-04-26 18:38:19,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2025-04-26 18:38:19,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 18:38:19,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 62 flow [2025-04-26 18:38:19,793 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 23 transitions, 62 flow [2025-04-26 18:38:19,793 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 23 transitions, 62 flow [2025-04-26 18:38:19,819 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 318 states, 307 states have (on average 2.6091205211726383) internal successors, (in total 801), 317 states have internal predecessors, (801), 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:38:19,819 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 318 states, 307 states have (on average 2.6091205211726383) internal successors, (in total 801), 317 states have internal predecessors, (801), 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:38:19,820 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:19,858 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 554#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONASSERT, workerFINAL]true [2025-04-26 18:38:19,871 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 520#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONASSERT, workerFINAL]true [2025-04-26 18:38:19,885 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 632#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerEXIT, workerFINAL]true [2025-04-26 18:38:19,909 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 626#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL, workerEXIT]true [2025-04-26 18:38:19,910 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 592#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerFINAL, workerFINAL]true [2025-04-26 18:38:19,910 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 384#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L31, L30]true [2025-04-26 18:38:19,920 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 360#[L31, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L30]true [2025-04-26 18:38:19,920 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 292#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L30, L30]true [2025-04-26 18:38:19,920 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 234#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L30]true [2025-04-26 18:38:19,923 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 220#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L30, $Ultimate##0]true [2025-04-26 18:38:19,924 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 174#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2025-04-26 18:38:19,925 WARN L140 AmpleReduction]: Number of pruned transitions: 196 [2025-04-26 18:38:19,925 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 11 [2025-04-26 18:38:19,925 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 18:38:19,925 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:176 [2025-04-26 18:38:19,925 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:113 [2025-04-26 18:38:19,925 WARN L145 AmpleReduction]: Times succ was already a loop node:16 [2025-04-26 18:38:19,925 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1 [2025-04-26 18:38:19,925 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:19,926 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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:38:19,926 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:19,926 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:19,926 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:19,926 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:19,926 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:19,926 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:19,926 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:19,926 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:19,926 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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:38:19,930 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 119 [2025-04-26 18:38:19,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:19,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:19,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:19,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:19,930 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:19,931 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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:38:19,934 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 119 [2025-04-26 18:38:19,934 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:19,934 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:19,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:19,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:19,935 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 18:38:19,935 INFO L754 eck$LassoCheckResult]: Loop: "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[82] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[84] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[85] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[86] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" [2025-04-26 18:38:19,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 3260, now seen corresponding path program 1 times [2025-04-26 18:38:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519779454] [2025-04-26 18:38:19,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:19,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:19,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:19,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:19,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1932577725, now seen corresponding path program 1 times [2025-04-26 18:38:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:19,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515574593] [2025-04-26 18:38:19,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:19,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:19,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:19,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:19,968 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:38:19,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:19,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515574593] [2025-04-26 18:38:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515574593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490245475] [2025-04-26 18:38:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:19,969 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:19,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:19,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:19,970 INFO L87 Difference]: Start difference. First operand has 290 states, 279 states have (on average 1.92831541218638) internal successors, (in total 538), 289 states have internal predecessors, (538), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 2 states have internal predecessors, (8), 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:38:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:20,005 INFO L93 Difference]: Finished difference Result 321 states and 648 transitions. [2025-04-26 18:38:20,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 321 states and 648 transitions. [2025-04-26 18:38:20,008 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 148 [2025-04-26 18:38:20,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 321 states to 308 states and 620 transitions. [2025-04-26 18:38:20,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-04-26 18:38:20,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2025-04-26 18:38:20,015 INFO L74 IsDeterministic]: Start isDeterministic. Operand 308 states and 620 transitions. [2025-04-26 18:38:20,016 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:20,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 620 transitions. [2025-04-26 18:38:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 620 transitions. [2025-04-26 18:38:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2025-04-26 18:38:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 2.015625) internal successors, (in total 516), 255 states have internal predecessors, (516), 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:38:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 516 transitions. [2025-04-26 18:38:20,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 256 states and 516 transitions. [2025-04-26 18:38:20,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:20,030 INFO L438 stractBuchiCegarLoop]: Abstraction has 256 states and 516 transitions. [2025-04-26 18:38:20,031 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:20,031 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 516 transitions. [2025-04-26 18:38:20,032 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 143 [2025-04-26 18:38:20,032 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:20,032 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:20,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:20,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:20,033 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[75] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 18:38:20,033 INFO L754 eck$LassoCheckResult]: Loop: "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[90] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[77] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[79] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[80] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[81] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 18:38:20,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 3135694, now seen corresponding path program 1 times [2025-04-26 18:38:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:20,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096672567] [2025-04-26 18:38:20,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:20,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:20,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:20,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:20,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:20,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:20,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:20,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1326702337, now seen corresponding path program 1 times [2025-04-26 18:38:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:20,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077904339] [2025-04-26 18:38:20,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:20,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:20,058 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:38:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:20,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077904339] [2025-04-26 18:38:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077904339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85820634] [2025-04-26 18:38:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:20,059 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:20,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:20,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:20,059 INFO L87 Difference]: Start difference. First operand 256 states and 516 transitions. cyclomatic complexity: 277 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:38:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:20,109 INFO L93 Difference]: Finished difference Result 302 states and 605 transitions. [2025-04-26 18:38:20,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 605 transitions. [2025-04-26 18:38:20,113 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 131 [2025-04-26 18:38:20,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 297 states and 593 transitions. [2025-04-26 18:38:20,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2025-04-26 18:38:20,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2025-04-26 18:38:20,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 297 states and 593 transitions. [2025-04-26 18:38:20,118 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:20,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 297 states and 593 transitions. [2025-04-26 18:38:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 593 transitions. [2025-04-26 18:38:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 261. [2025-04-26 18:38:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 261 states have (on average 1.9808429118773947) internal successors, (in total 517), 260 states have internal predecessors, (517), 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:38:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 517 transitions. [2025-04-26 18:38:20,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 261 states and 517 transitions. [2025-04-26 18:38:20,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:20,136 INFO L438 stractBuchiCegarLoop]: Abstraction has 261 states and 517 transitions. [2025-04-26 18:38:20,136 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:20,136 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 517 transitions. [2025-04-26 18:38:20,138 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 131 [2025-04-26 18:38:20,138 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:20,138 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:20,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:38:20,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:20,140 INFO L752 eck$LassoCheckResult]: Stem: "[72] $Ultimate##0-->L18: Formula: (= v_c_1 0) InVars {} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" "[67] L18-->L19-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[75] L20-->L21-2: Formula: (<= v_i_3 0) InVars {i=v_i_3} OutVars{i=v_i_3} AuxVars[] AssignedVars[]" [2025-04-26 18:38:20,141 INFO L754 eck$LassoCheckResult]: Loop: "[82] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[90] L19-1-->$Ultimate##0: Formula: (= v_i_19 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_19} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_19} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0]" "[77] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[79] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[80] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[81] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[]" "[85] L31-->workerFINAL: Formula: (= v_c_7 (+ v_i_9 v_c_6)) InVars {i=v_i_9, c=v_c_7} OutVars{i=v_i_9, c=v_c_6} AuxVars[] AssignedVars[c]" "[86] workerFINAL-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[91] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_21) InVars {i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_21, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[73] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i]" "[89] L19-1-->$Ultimate##0: Formula: (= v_i_17 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_17} OutVars{i=v_i_17, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0]" "[74] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[92] workerEXIT-->L21-2: Formula: (= v_i_23 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_23} AuxVars[] AssignedVars[]" [2025-04-26 18:38:20,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 3135694, now seen corresponding path program 2 times [2025-04-26 18:38:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:20,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016358850] [2025-04-26 18:38:20,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:20,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:20,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:20,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:20,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:20,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:20,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 18321209, now seen corresponding path program 1 times [2025-04-26 18:38:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:20,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580480134] [2025-04-26 18:38:20,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:20,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:20,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:20,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:20,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:20,173 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure ULTIMATE.start at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:115) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:175) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:74) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:441) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:377) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:353) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:847) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:767) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runSingleCegarLoop(BuchiAutomizerObserver.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-26 18:38:20,178 INFO L158 Benchmark]: Toolchain (without parser) took 1727.74ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 93.5MB in the beginning and 33.2MB in the end (delta: 60.3MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2025-04-26 18:38:20,178 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:20,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 91.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:20,179 INFO L158 Benchmark]: Boogie Preprocessor took 22.07ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 90.8MB in the end (delta: 879.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:20,179 INFO L158 Benchmark]: RCFGBuilder took 161.28ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 82.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:20,179 INFO L158 Benchmark]: BuchiAutomizer took 1509.15ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.0MB in the beginning and 33.2MB in the end (delta: 48.9MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2025-04-26 18:38:20,180 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.17ms. Allocated memory is still 167.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 91.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.07ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 90.8MB in the end (delta: 879.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 161.28ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 82.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1509.15ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.0MB in the beginning and 33.2MB in the end (delta: 48.9MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 17 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 160, Number of transitions in reduction automaton: 67, Number of states in reduction automaton: 45, Underlying: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No thread ID for procedure ULTIMATE.start de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure ULTIMATE.start: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-04-26 18:38:20,194 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...