/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/ForkInLoop02-Incrementer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:03,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:03,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:03,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:03,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:03,409 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:03,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:03,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:03,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:03,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:03,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:03,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:03,433 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:03,433 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:03,433 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:03,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:03,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:03,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:03,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:03,435 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:03,436 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:03,436 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:03,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:03,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:03,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:03,658 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:03,659 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:03,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl [2025-04-26 18:38:03,662 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl' [2025-04-26 18:38:03,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:03,677 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:03,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:03,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:03,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:03,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,706 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:03,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:03,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:03,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:03,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:03,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:03,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:03,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:03,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:03,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/1) ... [2025-04-26 18:38:03,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:03,756 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:03,759 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:03,780 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2025-04-26 18:38:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-04-26 18:38:03,781 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-04-26 18:38:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:03,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:03,781 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:03,812 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:03,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:03,865 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:03,865 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:03,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:03,872 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:38:03,873 INFO L201 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:03 BoogieIcfgContainer [2025-04-26 18:38:03,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:03,875 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:03,875 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:03,881 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:03,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:03,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:03" (1/2) ... [2025-04-26 18:38:03,884 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31de685f and model type ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:03, skipping insertion in model container [2025-04-26 18:38:03,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:03,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:03" (2/2) ... [2025-04-26 18:38:03,885 INFO L376 chiAutomizerObserver]: Analyzing ICFG ForkInLoop02-Incrementer.bpl [2025-04-26 18:38:03,916 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:03,954 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:03,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:03,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:03,958 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:03,960 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:04,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 11 transitions, 26 flow [2025-04-26 18:38:04,013 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-26 18:38:04,015 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 18:38:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 1/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 4. Up to 2 conditions per place. [2025-04-26 18:38:04,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 11 transitions, 26 flow [2025-04-26 18:38:04,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 11 transitions, 26 flow [2025-04-26 18:38:04,022 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 13 places, 11 transitions, 26 flow [2025-04-26 18:38:04,022 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 13 places, 11 transitions, 26 flow [2025-04-26 18:38:04,028 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 21 states have (on average 1.9047619047619047) internal successors, (in total 40), 23 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:04,028 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 24 states, 21 states have (on average 1.9047619047619047) internal successors, (in total 40), 23 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:04,030 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:04,040 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 56#[fooFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:38:04,041 WARN L140 AmpleReduction]: Number of pruned transitions: 7 [2025-04-26 18:38:04,041 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:04,041 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:04,041 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:8 [2025-04-26 18:38:04,041 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5 [2025-04-26 18:38:04,041 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:04,041 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:04,041 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:04,042 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 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:04,049 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:04,049 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:04,049 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:04,049 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:04,049 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:04,049 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:04,049 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:04,051 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:04,053 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 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:04,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:04,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,061 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,064 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:04,064 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 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:04,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:04,066 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,066 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,067 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,072 INFO L752 eck$LassoCheckResult]: Stem: "[18] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[14] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[28] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_newid_5) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0]" "[22] $Ultimate##0-->L31: Formula: (= (+ v_n_2 1) v_n_1) InVars {n=v_n_2} OutVars{n=v_n_1} AuxVars[] AssignedVars[n]" "[17] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[26] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[23] L31-->fooErr0ASSERT_VIOLATIONASSERT: Formula: (< 2 v_n_3) InVars {n=v_n_3} OutVars{n=v_n_3} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,072 INFO L754 eck$LassoCheckResult]: Loop: "[27] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 965346679, now seen corresponding path program 1 times [2025-04-26 18:38:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327732829] [2025-04-26 18:38:04,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:04,209 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:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:04,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327732829] [2025-04-26 18:38:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327732829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:04,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919665709] [2025-04-26 18:38:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:04,218 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:04,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2025-04-26 18:38:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584439936] [2025-04-26 18:38:04,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:04,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:04,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:04,265 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:04,287 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-04-26 18:38:04,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 12 transitions. [2025-04-26 18:38:04,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 8 transitions. [2025-04-26 18:38:04,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 18:38:04,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-04-26 18:38:04,325 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8 states and 8 transitions. [2025-04-26 18:38:04,325 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:04,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 18:38:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 8 transitions. [2025-04-26 18:38:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-04-26 18:38:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.0) internal successors, (in total 8), 7 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:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-04-26 18:38:04,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 18:38:04,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:04,376 INFO L438 stractBuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 18:38:04,376 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:04,376 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2025-04-26 18:38:04,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,378 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,378 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,380 INFO L752 eck$LassoCheckResult]: Stem: "[18] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[14] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[28] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_newid_5) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0]" "[22] $Ultimate##0-->L31: Formula: (= (+ v_n_2 1) v_n_1) InVars {n=v_n_2} OutVars{n=v_n_1} AuxVars[] AssignedVars[n]" "[17] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[26] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[24] L31-->fooFINAL: Formula: (<= v_n_4 2) InVars {n=v_n_4} OutVars{n=v_n_4} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,380 INFO L754 eck$LassoCheckResult]: Loop: "[27] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 965346680, now seen corresponding path program 1 times [2025-04-26 18:38:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287784695] [2025-04-26 18:38:04,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 2 times [2025-04-26 18:38:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402063007] [2025-04-26 18:38:04,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:04,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,407 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:04,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:04,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash -139023965, now seen corresponding path program 1 times [2025-04-26 18:38:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194152627] [2025-04-26 18:38:04,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:04,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:04,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,534 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:04,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:04,547 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:04,548 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:04,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:04,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:04,550 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:04,551 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:04,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:04,567 INFO L116 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-04-26 18:38:04,567 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:38:04,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 19 events. 1/19 cut-off events. For 2/2 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 14. Up to 3 conditions per place. [2025-04-26 18:38:04,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:04,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:04,568 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:04,568 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 18:38:04,578 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119 states, 112 states have (on average 2.5982142857142856) internal successors, (in total 291), 118 states have internal predecessors, (291), 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:04,579 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 119 states, 112 states have (on average 2.5982142857142856) internal successors, (in total 291), 118 states have internal predecessors, (291), 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:04,579 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:04,607 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:38:04,608 WARN L140 AmpleReduction]: Number of pruned transitions: 15 [2025-04-26 18:38:04,608 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:04,608 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:04,608 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 18:38:04,608 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 18:38:04,608 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:04,608 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:04,608 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:04,608 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 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:04,608 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:04,608 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:04,608 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:04,608 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:04,608 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:04,608 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:04,608 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:04,608 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:04,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 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:04,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,610 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,610 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:04,610 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 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:04,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,614 INFO L752 eck$LassoCheckResult]: Stem: "[34] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[30] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[48] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_9 v_fooThread1of2ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_9} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_9, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_thidvar0]" "[33] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[49] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_newid_11) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_11} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_11} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0]" "[33] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[46] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,614 INFO L754 eck$LassoCheckResult]: Loop: "[47] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1537568080, now seen corresponding path program 1 times [2025-04-26 18:38:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611419463] [2025-04-26 18:38:04,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2025-04-26 18:38:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005578523] [2025-04-26 18:38:04,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -419970177, now seen corresponding path program 1 times [2025-04-26 18:38:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651875190] [2025-04-26 18:38:04,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:04,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:04,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:04,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:04,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:04,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,688 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:04,692 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:04,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2025-04-26 18:38:04,705 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:04,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:04,718 INFO L229 MonitoredProcess]: Starting monitored process 4 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:04,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 18:38:04,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 60 flow [2025-04-26 18:38:04,735 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-26 18:38:04,735 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 18:38:04,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 1/26 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-04-26 18:38:04,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 21 transitions, 60 flow [2025-04-26 18:38:04,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 21 transitions, 60 flow [2025-04-26 18:38:04,736 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 21 transitions, 60 flow [2025-04-26 18:38:04,736 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 60 flow [2025-04-26 18:38:04,775 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 594 states, 579 states have (on average 3.326424870466321) internal successors, (in total 1926), 593 states have internal predecessors, (1926), 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:04,776 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 594 states, 579 states have (on average 3.326424870466321) internal successors, (in total 1926), 593 states have internal predecessors, (1926), 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:04,776 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:04,839 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 178#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2025-04-26 18:38:04,839 WARN L140 AmpleReduction]: Number of pruned transitions: 99 [2025-04-26 18:38:04,839 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:04,839 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:04,839 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:84 [2025-04-26 18:38:04,839 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:62 [2025-04-26 18:38:04,839 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:04,839 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:04,843 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:04,844 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 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:04,844 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:04,844 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:04,844 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:04,844 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:04,844 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:04,844 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:04,844 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:04,844 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:04,845 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 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:04,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,849 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,849 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,850 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:04,850 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 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:04,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:04,854 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:04,854 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:04,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:04,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:04,855 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[67] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[89] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_16 v_fooThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_16} OutVars{fooThread1of3ForFork0_thidvar0=v_fooThread1of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_16} AuxVars[] AssignedVars[fooThread1of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[90] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_18) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_18} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_18, fooThread2of3ForFork0_thidvar0=v_fooThread2of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[91] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_20) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} OutVars{fooThread3of3ForFork0_thidvar0=v_fooThread3of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} AuxVars[] AssignedVars[fooThread3of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[87] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,855 INFO L754 eck$LassoCheckResult]: Loop: "[88] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:04,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 600195478, now seen corresponding path program 1 times [2025-04-26 18:38:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278581720] [2025-04-26 18:38:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:04,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:04,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:04,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 18:38:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858202984] [2025-04-26 18:38:04,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1426190722, now seen corresponding path program 1 times [2025-04-26 18:38:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:04,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901619878] [2025-04-26 18:38:04,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:04,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:04,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:04,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:04,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:04,919 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:04,923 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:04,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2025-04-26 18:38:04,931 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:04,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:04,934 INFO L229 MonitoredProcess]: Starting monitored process 5 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:04,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 18:38:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 80 flow [2025-04-26 18:38:04,953 INFO L116 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-04-26 18:38:04,953 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-26 18:38:04,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 33 events. 1/33 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 5 conditions per place. [2025-04-26 18:38:04,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 26 transitions, 80 flow [2025-04-26 18:38:04,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 26 transitions, 80 flow [2025-04-26 18:38:04,953 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 26 transitions, 80 flow [2025-04-26 18:38:04,953 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 26 transitions, 80 flow [2025-04-26 18:38:05,028 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2969 states, 2938 states have (on average 4.084751531654186) internal successors, (in total 12001), 2968 states have internal predecessors, (12001), 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:05,035 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 2969 states, 2938 states have (on average 4.084751531654186) internal successors, (in total 12001), 2968 states have internal predecessors, (12001), 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:05,035 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:05,210 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 453#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [2025-04-26 18:38:05,210 WARN L140 AmpleReduction]: Number of pruned transitions: 704 [2025-04-26 18:38:05,210 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:05,210 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:05,210 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:332 [2025-04-26 18:38:05,210 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:348 [2025-04-26 18:38:05,210 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:05,210 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:05,210 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:05,213 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 681 states, 650 states have (on average 1.9338461538461538) internal successors, (in total 1257), 680 states have internal predecessors, (1257), 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:05,214 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:05,214 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:05,214 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:05,214 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:05,214 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:05,214 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:05,214 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:05,214 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:05,215 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 681 states, 650 states have (on average 1.9338461538461538) internal successors, (in total 1257), 680 states have internal predecessors, (1257), 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:05,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:05,237 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:05,237 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:05,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:05,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:05,237 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:05,238 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 681 states, 650 states have (on average 1.9338461538461538) internal successors, (in total 1257), 680 states have internal predecessors, (1257), 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:05,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:05,249 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:05,249 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:05,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:05,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:05,250 INFO L752 eck$LassoCheckResult]: Stem: "[145] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[141] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[167] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_26 v_fooThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_26} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_26, fooThread1of4ForFork0_thidvar0=v_fooThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[168] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_28) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_28} OutVars{fooThread2of4ForFork0_thidvar0=v_fooThread2of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_28} AuxVars[] AssignedVars[fooThread2of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[169] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_30) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_30} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_30, fooThread3of4ForFork0_thidvar0=v_fooThread3of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[170] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_32) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_32} OutVars{fooThread4of4ForFork0_thidvar0=v_fooThread4of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_32} AuxVars[] AssignedVars[fooThread4of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[165] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:05,250 INFO L754 eck$LassoCheckResult]: Loop: "[166] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:05,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -950132790, now seen corresponding path program 1 times [2025-04-26 18:38:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:05,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302753427] [2025-04-26 18:38:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:05,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:05,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 197, now seen corresponding path program 1 times [2025-04-26 18:38:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:05,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675688656] [2025-04-26 18:38:05,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:05,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:05,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:05,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:05,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:05,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:05,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 610654748, now seen corresponding path program 1 times [2025-04-26 18:38:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:05,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043338675] [2025-04-26 18:38:05,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:05,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:05,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:05,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:38:05,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:38:05,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:05,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:05,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:38:05,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:38:05,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:05,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:05,347 WARN L166 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:05,352 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:05,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:05,361 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:05,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:05,364 INFO L229 MonitoredProcess]: Starting monitored process 6 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:05,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2025-04-26 18:38:05,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 102 flow [2025-04-26 18:38:05,385 INFO L116 PetriNetUnfolderBase]: 1/40 cut-off events. [2025-04-26 18:38:05,385 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-26 18:38:05,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 40 events. 1/40 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 6 conditions per place. [2025-04-26 18:38:05,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 31 transitions, 102 flow [2025-04-26 18:38:05,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 102 flow [2025-04-26 18:38:05,387 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 31 transitions, 102 flow [2025-04-26 18:38:05,387 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 31 transitions, 102 flow [2025-04-26 18:38:05,765 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14844 states, 14781 states have (on average 4.862729179351871) internal successors, (in total 71876), 14843 states have internal predecessors, (71876), 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:05,809 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 14844 states, 14781 states have (on average 4.862729179351871) internal successors, (in total 71876), 14843 states have internal predecessors, (71876), 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:05,810 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:06,150 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1122#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:38:06,150 WARN L140 AmpleReduction]: Number of pruned transitions: 4626 [2025-04-26 18:38:06,150 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:06,150 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:06,150 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1294 [2025-04-26 18:38:06,150 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1786 [2025-04-26 18:38:06,150 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:06,150 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:06,150 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:06,155 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3081 states, 3018 states have (on average 2.1139827700463885) internal successors, (in total 6380), 3080 states have internal predecessors, (6380), 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:06,156 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:06,156 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:06,156 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:06,156 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:06,156 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:06,156 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:06,156 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:06,156 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:06,159 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3081 states, 3018 states have (on average 2.1139827700463885) internal successors, (in total 6380), 3080 states have internal predecessors, (6380), 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:06,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:06,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:06,204 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:06,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:06,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:06,204 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:06,209 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3081 states, 3018 states have (on average 2.1139827700463885) internal successors, (in total 6380), 3080 states have internal predecessors, (6380), 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:06,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:06,240 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:06,240 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:06,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:06,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:06,242 INFO L752 eck$LassoCheckResult]: Stem: "[272] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[268] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[298] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_39) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_39} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_39, fooThread1of5ForFork0_thidvar0=v_fooThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[299] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_41 v_fooThread2of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_41} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_41, fooThread2of5ForFork0_thidvar0=v_fooThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[300] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_43) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_43} OutVars{fooThread3of5ForFork0_thidvar0=v_fooThread3of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_43} AuxVars[] AssignedVars[fooThread3of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[301] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_45) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_45} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_45, fooThread4of5ForFork0_thidvar0=v_fooThread4of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[302] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_47 v_fooThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_47} OutVars{fooThread5of5ForFork0_thidvar0=v_fooThread5of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_47} AuxVars[] AssignedVars[fooThread5of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[296] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:06,242 INFO L754 eck$LassoCheckResult]: Loop: "[297] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:06,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1201729596, now seen corresponding path program 1 times [2025-04-26 18:38:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:06,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390916735] [2025-04-26 18:38:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:06,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:06,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:06,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:06,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:06,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash 328, now seen corresponding path program 1 times [2025-04-26 18:38:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:06,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321746139] [2025-04-26 18:38:06,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:06,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:06,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:06,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:06,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1401087891, now seen corresponding path program 1 times [2025-04-26 18:38:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:06,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590684001] [2025-04-26 18:38:06,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:06,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:38:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:38:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:06,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:38:06,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:38:06,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:06,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:06,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:06,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:06,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:06,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:06,369 WARN L166 chiAutomizerObserver]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:06,373 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:06,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:06,382 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:06,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:06,384 INFO L229 MonitoredProcess]: Starting monitored process 7 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:06,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2025-04-26 18:38:06,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 126 flow [2025-04-26 18:38:06,405 INFO L116 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-04-26 18:38:06,405 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-26 18:38:06,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 47 events. 1/47 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 64. Up to 7 conditions per place. [2025-04-26 18:38:06,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 36 transitions, 126 flow [2025-04-26 18:38:06,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 36 transitions, 126 flow [2025-04-26 18:38:06,406 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 48 places, 36 transitions, 126 flow [2025-04-26 18:38:06,406 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 126 flow [2025-04-26 18:38:08,287 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 74219 states, 74092 states have (on average 5.651770771473304) internal successors, (in total 418751), 74218 states have internal predecessors, (418751), 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:08,454 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 74219 states, 74092 states have (on average 5.651770771473304) internal successors, (in total 418751), 74218 states have internal predecessors, (418751), 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:08,454 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:09,799 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2899#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 18:38:09,800 WARN L140 AmpleReduction]: Number of pruned transitions: 27950 [2025-04-26 18:38:09,800 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:09,800 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:09,800 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:5097 [2025-04-26 18:38:09,800 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8614 [2025-04-26 18:38:09,800 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:09,800 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:09,800 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:09,817 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 13712 states, 13585 states have (on average 2.278248067721752) internal successors, (in total 30950), 13711 states have internal predecessors, (30950), 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:09,818 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:09,818 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:09,818 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:09,818 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:09,818 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:09,818 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:09,818 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:09,818 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:09,831 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13712 states, 13585 states have (on average 2.278248067721752) internal successors, (in total 30950), 13711 states have internal predecessors, (30950), 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:09,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:09,947 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:09,947 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:09,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:09,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:09,948 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:09,966 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13712 states, 13585 states have (on average 2.278248067721752) internal successors, (in total 30950), 13711 states have internal predecessors, (30950), 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:10,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:10,057 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:10,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:10,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:10,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:10,058 INFO L752 eck$LassoCheckResult]: Stem: "[468] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[464] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[498] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_55) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} OutVars{fooThread1of6ForFork0_thidvar0=v_fooThread1of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} AuxVars[] AssignedVars[fooThread1of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[499] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_57 v_fooThread2of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_57} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_57, fooThread2of6ForFork0_thidvar0=v_fooThread2of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[500] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_59) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_59} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_59, fooThread3of6ForFork0_thidvar0=v_fooThread3of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[501] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_61) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_61} OutVars{fooThread4of6ForFork0_thidvar0=v_fooThread4of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_61} AuxVars[] AssignedVars[fooThread4of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[502] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_63 v_fooThread5of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_63} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_63, fooThread5of6ForFork0_thidvar0=v_fooThread5of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread5of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[503] L20-1-->$Ultimate##0: Formula: (= v_fooThread6of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_65) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} OutVars{fooThread6of6ForFork0_thidvar0=v_fooThread6of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} AuxVars[] AssignedVars[fooThread6of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[496] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:10,058 INFO L754 eck$LassoCheckResult]: Loop: "[497] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:10,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1036479964, now seen corresponding path program 1 times [2025-04-26 18:38:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:10,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785667990] [2025-04-26 18:38:10,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:10,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:10,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:10,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:10,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 528, now seen corresponding path program 1 times [2025-04-26 18:38:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:10,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571999234] [2025-04-26 18:38:10,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:10,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:10,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:10,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:10,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:10,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:10,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:10,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2066108309, now seen corresponding path program 1 times [2025-04-26 18:38:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:10,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232905423] [2025-04-26 18:38:10,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:10,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:10,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:10,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:10,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:38:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:38:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:10,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:10,152 WARN L166 chiAutomizerObserver]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:10,156 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:10,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:10,164 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:10,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:10,166 INFO L229 MonitoredProcess]: Starting monitored process 8 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:10,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2025-04-26 18:38:10,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 152 flow [2025-04-26 18:38:10,187 INFO L116 PetriNetUnfolderBase]: 1/54 cut-off events. [2025-04-26 18:38:10,187 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-26 18:38:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 54 events. 1/54 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-04-26 18:38:10,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 41 transitions, 152 flow [2025-04-26 18:38:10,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 41 transitions, 152 flow [2025-04-26 18:38:10,188 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 55 places, 41 transitions, 152 flow [2025-04-26 18:38:10,188 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 41 transitions, 152 flow [2025-04-26 18:38:21,255 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 371094 states, 370839 states have (on average 6.446533401287351) internal successors, (in total 2390626), 371093 states have internal predecessors, (2390626), 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:21,916 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 371094 states, 370839 states have (on average 6.446533401287351) internal successors, (in total 2390626), 371093 states have internal predecessors, (2390626), 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:21,917 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:25,273 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7440#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [2025-04-26 18:38:25,273 WARN L140 AmpleReduction]: Number of pruned transitions: 159021 [2025-04-26 18:38:25,273 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:38:25,273 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 18:38:25,273 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20302 [2025-04-26 18:38:25,273 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:40203 [2025-04-26 18:38:25,273 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:25,273 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:25,273 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:25,377 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 60506 states, 60251 states have (on average 2.4244908798194222) internal successors, (in total 146078), 60505 states have internal predecessors, (146078), 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:25,378 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:25,378 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:25,378 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:25,378 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:25,378 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:25,378 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:25,378 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:25,378 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:25,457 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60506 states, 60251 states have (on average 2.4244908798194222) internal successors, (in total 146078), 60505 states have internal predecessors, (146078), 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:26,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,054 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,054 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,054 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:26,143 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60506 states, 60251 states have (on average 2.4244908798194222) internal successors, (in total 146078), 60505 states have internal predecessors, (146078), 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:26,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:26,805 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:26,805 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:26,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:26,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:26,806 INFO L752 eck$LassoCheckResult]: Stem: "[749] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[745] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[783] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_74) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_74} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_74, fooThread1of7ForFork0_thidvar0=v_fooThread1of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[784] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_76 v_fooThread2of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_76} OutVars{fooThread2of7ForFork0_thidvar0=v_fooThread2of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_76} AuxVars[] AssignedVars[fooThread2of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[785] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_78) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_78} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_78, fooThread3of7ForFork0_thidvar0=v_fooThread3of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[786] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_80) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_80} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_80, fooThread4of7ForFork0_thidvar0=v_fooThread4of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[787] L20-1-->$Ultimate##0: Formula: (= v_fooThread5of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_82) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_82} OutVars{fooThread5of7ForFork0_thidvar0=v_fooThread5of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_82} AuxVars[] AssignedVars[fooThread5of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[788] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_84 v_fooThread6of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_84} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_84, fooThread6of7ForFork0_thidvar0=v_fooThread6of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread6of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[789] L20-1-->$Ultimate##0: Formula: (= v_fooThread7of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_86) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_86} OutVars{fooThread7of7ForFork0_thidvar0=v_fooThread7of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_86} AuxVars[] AssignedVars[fooThread7of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[781] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:26,806 INFO L754 eck$LassoCheckResult]: Loop: "[782] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:26,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash -832484454, now seen corresponding path program 1 times [2025-04-26 18:38:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588514084] [2025-04-26 18:38:26,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 813, now seen corresponding path program 1 times [2025-04-26 18:38:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269351704] [2025-04-26 18:38:26,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:26,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:26,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash -37213516, now seen corresponding path program 1 times [2025-04-26 18:38:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:26,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699263741] [2025-04-26 18:38:26,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:26,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:26,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:38:26,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:38:26,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:38:26,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:38:26,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:26,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:26,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:26,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:26,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:26,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:26,929 WARN L166 chiAutomizerObserver]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:26,935 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 18:38:26,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Ended with exit code 0 [2025-04-26 18:38:26,948 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:26,951 INFO L229 MonitoredProcess]: Starting monitored process 9 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:26,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2025-04-26 18:38:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 180 flow [2025-04-26 18:38:26,979 INFO L116 PetriNetUnfolderBase]: 1/61 cut-off events. [2025-04-26 18:38:26,979 INFO L117 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-04-26 18:38:26,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 61 events. 1/61 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 95. Up to 9 conditions per place. [2025-04-26 18:38:26,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 180 flow [2025-04-26 18:38:26,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 46 transitions, 180 flow [2025-04-26 18:38:26,983 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 62 places, 46 transitions, 180 flow [2025-04-26 18:38:26,983 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 46 transitions, 180 flow