/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:11:53,545 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:11:53,615 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:11:53,646 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:11:53,646 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:11:53,647 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:11:53,648 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:11:53,648 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:11:53,648 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:11:53,649 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:11:53,649 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:11:53,649 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:11:53,649 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:11:53,650 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:11:53,650 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:11:53,650 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:11:53,651 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:11:53,651 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:11:53,651 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:11:53,652 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:11:53,652 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:11:53,653 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:11:53,653 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:11:53,653 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:11:53,654 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:11:53,654 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:11:53,654 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:11:53,654 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:11:53,655 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:11:53,655 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:11:53,655 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:11:53,656 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:11:53,656 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:11:53,657 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:11:53,657 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:11:53,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:11:53,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:11:53,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:11:53,862 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:11:53,863 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:11:53,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl [2023-10-12 17:11:53,865 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl' [2023-10-12 17:11:53,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:11:53,885 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:11:53,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:53,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:11:53,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:11:53,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,910 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:11:53,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:53,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:11:53,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:11:53,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:11:53,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:11:53,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:11:53,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:11:53,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:11:53,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/1) ... [2023-10-12 17:11:53,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:11:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:11:53,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:11:53,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:11:53,994 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2023-10-12 17:11:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2023-10-12 17:11:53,994 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2023-10-12 17:11:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:11:53,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:11:53,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:11:54,037 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:11:54,039 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:11:54,110 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:11:54,121 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:11:54,121 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:11:54,123 INFO L201 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:54 BoogieIcfgContainer [2023-10-12 17:11:54,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:11:54,125 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:11:54,125 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:11:54,129 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:11:54,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:54,130 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:53" (1/2) ... [2023-10-12 17:11:54,131 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61d58359 and model type ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:11:54, skipping insertion in model container [2023-10-12 17:11:54,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:54,131 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:54" (2/2) ... [2023-10-12 17:11:54,135 INFO L332 chiAutomizerObserver]: Analyzing ICFG ForkInLoop02-Incrementer.bpl [2023-10-12 17:11:54,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:54,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,299 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-10-12 17:11:54,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:11:54,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 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 5. Up to 2 conditions per place. [2023-10-12 17:11:54,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,310 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:54,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 11 transitions, 27 flow [2023-10-12 17:11:54,346 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2023-10-12 17:11:54,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:11:54,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 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 5. Up to 2 conditions per place. [2023-10-12 17:11:54,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 32 [2023-10-12 17:11:54,496 INFO L134 LiptonReduction]: Checked pairs total: 30 [2023-10-12 17:11:54,496 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:11:54,511 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:54,511 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:54,511 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:54,511 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:54,512 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:54,512 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:54,512 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:54,512 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:54,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:54,542 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:11:54,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:54,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:54,546 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:11:54,546 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:54,546 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:54,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 14 states, but on-demand construction may add more states [2023-10-12 17:11:54,550 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:11:54,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:54,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:54,551 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:11:54,551 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:54,556 INFO L748 eck$LassoCheckResult]: Stem: 16#[$Ultimate##0]don't care [29] $Ultimate##0-->L20-1: Formula: (and (= v_n_6 0) (= v_ULTIMATE.start_newid_6 0)) InVars {} OutVars{n=v_n_6, ULTIMATE.start_newid=v_ULTIMATE.start_newid_6} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 19#[L20-1]don't care [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] 23#[L21, $Ultimate##0]don't care [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] 27#[$Ultimate##0, L20-1]don't care [26] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 35#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:54,556 INFO L750 eck$LassoCheckResult]: Loop: 35#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [27] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 35#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:54,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1814921, now seen corresponding path program 1 times [2023-10-12 17:11:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283503777] [2023-10-12 17:11:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2023-10-12 17:11:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317783650] [2023-10-12 17:11:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 56262578, now seen corresponding path program 1 times [2023-10-12 17:11:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101920701] [2023-10-12 17:11:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,725 WARN L148 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:54,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,736 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2023-10-12 17:11:54,736 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:54,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 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 16. Up to 3 conditions per place. [2023-10-12 17:11:54,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,738 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:54,738 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,739 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:54,742 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2023-10-12 17:11:54,742 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:54,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 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 16. Up to 3 conditions per place. [2023-10-12 17:11:54,743 INFO L119 LiptonReduction]: Number of co-enabled transitions 104 [2023-10-12 17:11:54,860 INFO L134 LiptonReduction]: Checked pairs total: 214 [2023-10-12 17:11:54,861 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:11:54,862 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:54,862 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:54,862 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:54,863 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:54,863 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:54,863 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:54,863 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:54,863 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:54,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2023-10-12 17:11:54,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:54,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:54,889 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:11:54,889 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:54,889 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:54,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 78 states, but on-demand construction may add more states [2023-10-12 17:11:54,894 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2023-10-12 17:11:54,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:54,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:54,895 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:11:54,895 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:54,895 INFO L748 eck$LassoCheckResult]: Stem: 23#[$Ultimate##0]don't care [56] $Ultimate##0-->L20-1: Formula: (and (= v_ULTIMATE.start_newid_14 0) (= v_n_55 0)) InVars {} OutVars{n=v_n_55, ULTIMATE.start_newid=v_ULTIMATE.start_newid_14} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 26#[L20-1]don't care [52] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_11 v_fooThread1of2ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_11} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_11, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_thidvar0] 28#[L21, $Ultimate##0]don't care [37] 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] 32#[$Ultimate##0, L20-1]don't care [53] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_newid_13) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_13} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_13} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0] 38#[$Ultimate##0, L21, $Ultimate##0]don't care [37] 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] 48#[$Ultimate##0, L20-1, $Ultimate##0]don't care [50] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:54,896 INFO L750 eck$LassoCheckResult]: Loop: 64#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [51] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:54,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1755053670, now seen corresponding path program 1 times [2023-10-12 17:11:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132691145] [2023-10-12 17:11:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 82, now seen corresponding path program 1 times [2023-10-12 17:11:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061157930] [2023-10-12 17:11:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1427911129, now seen corresponding path program 1 times [2023-10-12 17:11:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983441891] [2023-10-12 17:11:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:54,955 WARN L148 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:54,961 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:54,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,968 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-10-12 17:11:54,968 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:11:54,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 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 28. Up to 4 conditions per place. [2023-10-12 17:11:54,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,969 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:54,970 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 63 flow [2023-10-12 17:11:54,974 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-10-12 17:11:54,974 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:11:54,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 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 28. Up to 4 conditions per place. [2023-10-12 17:11:54,975 INFO L119 LiptonReduction]: Number of co-enabled transitions 216 [2023-10-12 17:11:55,093 INFO L134 LiptonReduction]: Checked pairs total: 466 [2023-10-12 17:11:55,093 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-10-12 17:11:55,095 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:55,095 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:55,095 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:55,095 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:55,095 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:55,095 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:55,095 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:55,095 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:55,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:55,161 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2023-10-12 17:11:55,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:55,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:55,161 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2023-10-12 17:11:55,162 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:55,162 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:55,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 318 states, but on-demand construction may add more states [2023-10-12 17:11:55,178 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2023-10-12 17:11:55,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:55,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:55,178 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2023-10-12 17:11:55,178 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:55,179 INFO L748 eck$LassoCheckResult]: Stem: 30#[$Ultimate##0]don't care [87] $Ultimate##0-->L20-1: Formula: (and (= v_n_126 0) (= v_ULTIMATE.start_newid_25 0)) InVars {} OutVars{n=v_n_126, ULTIMATE.start_newid=v_ULTIMATE.start_newid_25} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 33#[L20-1]don't care [82] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_20 v_fooThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} OutVars{fooThread1of3ForFork0_thidvar0=v_fooThread1of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} AuxVars[] AssignedVars[fooThread1of3ForFork0_thidvar0] 37#[$Ultimate##0, L21]don't care [63] 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] 43#[$Ultimate##0, L20-1]don't care [83] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_22) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_22} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_22, fooThread2of3ForFork0_thidvar0=v_fooThread2of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of3ForFork0_thidvar0] 53#[$Ultimate##0, L21, $Ultimate##0]don't care [63] 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] 69#[$Ultimate##0, L20-1, $Ultimate##0]don't care [84] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_24) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_24} OutVars{fooThread3of3ForFork0_thidvar0=v_fooThread3of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_24} AuxVars[] AssignedVars[fooThread3of3ForFork0_thidvar0] 95#[$Ultimate##0, $Ultimate##0, L21, $Ultimate##0]don't care [63] 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] 137#[$Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0]don't care [80] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 203#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:55,179 INFO L750 eck$LassoCheckResult]: Loop: 203#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [81] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 203#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:55,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1136295478, now seen corresponding path program 1 times [2023-10-12 17:11:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683852207] [2023-10-12 17:11:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash 112, now seen corresponding path program 1 times [2023-10-12 17:11:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124998743] [2023-10-12 17:11:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 865421531, now seen corresponding path program 1 times [2023-10-12 17:11:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731315788] [2023-10-12 17:11:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,284 WARN L148 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:55,291 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:55,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,308 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-10-12 17:11:55,308 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:11:55,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 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 41. Up to 5 conditions per place. [2023-10-12 17:11:55,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,312 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:55,312 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,312 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 84 flow [2023-10-12 17:11:55,323 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-10-12 17:11:55,323 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:11:55,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 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 41. Up to 5 conditions per place. [2023-10-12 17:11:55,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 368 [2023-10-12 17:11:55,533 INFO L134 LiptonReduction]: Checked pairs total: 782 [2023-10-12 17:11:55,533 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:11:55,535 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:55,535 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:55,535 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:55,535 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:55,535 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:55,535 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:55,535 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:55,536 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:55,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:55,673 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 256 [2023-10-12 17:11:55,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:55,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:55,674 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:55,674 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:55,674 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:55,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1278 states, but on-demand construction may add more states [2023-10-12 17:11:55,700 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 256 [2023-10-12 17:11:55,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:55,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:55,701 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:55,701 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:55,702 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]don't care [127] $Ultimate##0-->L20-1: Formula: (and (= v_n_277 0) (= v_ULTIMATE.start_newid_39 0)) InVars {} OutVars{n=v_n_277, ULTIMATE.start_newid=v_ULTIMATE.start_newid_39} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 40#[L20-1]don't care [119] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_32 v_fooThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_32} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_32, fooThread1of4ForFork0_thidvar0=v_fooThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of4ForFork0_thidvar0] 44#[L21, $Ultimate##0]don't care [96] 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#[$Ultimate##0, L20-1]don't care [120] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_34) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_34} OutVars{fooThread2of4ForFork0_thidvar0=v_fooThread2of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_34} AuxVars[] AssignedVars[fooThread2of4ForFork0_thidvar0] 58#[$Ultimate##0, L21, $Ultimate##0]don't care [96] 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] 72#[L20-1, $Ultimate##0, $Ultimate##0]don't care [121] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_36) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_36} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_36, fooThread3of4ForFork0_thidvar0=v_fooThread3of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of4ForFork0_thidvar0] 98#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [96] 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] 136#[$Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0]don't care [122] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_38) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_38} OutVars{fooThread4of4ForFork0_thidvar0=v_fooThread4of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_38} AuxVars[] AssignedVars[fooThread4of4ForFork0_thidvar0] 202#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L21, $Ultimate##0]don't care [96] 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] 308#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [117] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 488#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:11:55,702 INFO L750 eck$LassoCheckResult]: Loop: 488#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [118] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 488#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:11:55,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 472372729, now seen corresponding path program 1 times [2023-10-12 17:11:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309989920] [2023-10-12 17:11:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:11:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881714967] [2023-10-12 17:11:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1758652829, now seen corresponding path program 1 times [2023-10-12 17:11:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:55,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057415282] [2023-10-12 17:11:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:55,816 WARN L148 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:55,825 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,842 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-10-12 17:11:55,842 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:11:55,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 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 55. Up to 6 conditions per place. [2023-10-12 17:11:55,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,844 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:55,845 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,845 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 107 flow [2023-10-12 17:11:55,850 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-10-12 17:11:55,850 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:11:55,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 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 55. Up to 6 conditions per place. [2023-10-12 17:11:55,851 INFO L119 LiptonReduction]: Number of co-enabled transitions 560 [2023-10-12 17:11:56,027 INFO L134 LiptonReduction]: Checked pairs total: 1223 [2023-10-12 17:11:56,028 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:11:56,029 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:56,029 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:56,029 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:56,029 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:56,030 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:56,030 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:56,030 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:56,030 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:56,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:56,450 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 1024 [2023-10-12 17:11:56,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:56,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:56,451 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:56,451 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:56,451 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:56,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5118 states, but on-demand construction may add more states [2023-10-12 17:11:56,586 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 1024 [2023-10-12 17:11:56,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:56,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:56,587 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:56,587 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:56,588 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]don't care [173] $Ultimate##0-->L20-1: Formula: (and (= v_n_552 0) (= v_ULTIMATE.start_newid_56 0)) InVars {} OutVars{n=v_n_552, ULTIMATE.start_newid=v_ULTIMATE.start_newid_56} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 47#[L20-1]don't care [163] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_47) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_47} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_47, fooThread1of5ForFork0_thidvar0=v_fooThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of5ForFork0_thidvar0] 49#[L21, $Ultimate##0]don't care [136] 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] 57#[L20-1, $Ultimate##0]don't care [164] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_49 v_fooThread2of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_49} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_49, fooThread2of5ForFork0_thidvar0=v_fooThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of5ForFork0_thidvar0] 65#[$Ultimate##0, $Ultimate##0, L21]don't care [136] 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] 81#[$Ultimate##0, $Ultimate##0, L20-1]don't care [165] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_51) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_51} OutVars{fooThread3of5ForFork0_thidvar0=v_fooThread3of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_51} AuxVars[] AssignedVars[fooThread3of5ForFork0_thidvar0] 103#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [136] 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] 143#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [166] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_53) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_53} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_53, fooThread4of5ForFork0_thidvar0=v_fooThread4of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of5ForFork0_thidvar0] 207#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [136] 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] 313#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [167] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_55 v_fooThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} OutVars{fooThread5of5ForFork0_thidvar0=v_fooThread5of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} AuxVars[] AssignedVars[fooThread5of5ForFork0_thidvar0] 483#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [136] 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] 757#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0]don't care [161] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1199#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:56,588 INFO L750 eck$LassoCheckResult]: Loop: 1199#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [162] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1199#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:56,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash -343704154, now seen corresponding path program 1 times [2023-10-12 17:11:56,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:56,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964754263] [2023-10-12 17:11:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:56,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 1 times [2023-10-12 17:11:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691886439] [2023-10-12 17:11:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:56,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2064894020, now seen corresponding path program 1 times [2023-10-12 17:11:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222578608] [2023-10-12 17:11:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:56,690 WARN L148 chiAutomizerObserver]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:56,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,706 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-10-12 17:11:56,706 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-10-12 17:11:56,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 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 70. Up to 7 conditions per place. [2023-10-12 17:11:56,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,707 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:56,708 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,708 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 132 flow [2023-10-12 17:11:56,712 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-10-12 17:11:56,712 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-10-12 17:11:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 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 70. Up to 7 conditions per place. [2023-10-12 17:11:56,713 INFO L119 LiptonReduction]: Number of co-enabled transitions 792 [2023-10-12 17:11:56,900 INFO L134 LiptonReduction]: Checked pairs total: 1757 [2023-10-12 17:11:56,901 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:11:56,902 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:56,902 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:56,902 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:56,902 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:56,902 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:56,902 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:56,902 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:56,902 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:56,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:58,797 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 4096 [2023-10-12 17:11:58,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:58,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:58,800 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:58,800 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:58,802 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:58,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 20478 states, but on-demand construction may add more states [2023-10-12 17:11:59,326 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 4096 [2023-10-12 17:11:59,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,327 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,328 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,328 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]don't care [226] $Ultimate##0-->L20-1: Formula: (and (= v_n_839 0) (= v_ULTIMATE.start_newid_76 0)) InVars {} OutVars{n=v_n_839, ULTIMATE.start_newid=v_ULTIMATE.start_newid_76} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 54#[L20-1]don't care [214] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_65) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} OutVars{fooThread1of6ForFork0_thidvar0=v_fooThread1of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} AuxVars[] AssignedVars[fooThread1of6ForFork0_thidvar0] 56#[L21, $Ultimate##0]don't care [183] 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] 62#[L20-1, $Ultimate##0]don't care [215] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_67 v_fooThread2of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_67} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_67, fooThread2of6ForFork0_thidvar0=v_fooThread2of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of6ForFork0_thidvar0] 68#[$Ultimate##0, L21, $Ultimate##0]don't care [183] 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] 84#[$Ultimate##0, L20-1, $Ultimate##0]don't care [216] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_69) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_69} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_69, fooThread3of6ForFork0_thidvar0=v_fooThread3of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of6ForFork0_thidvar0] 108#[$Ultimate##0, $Ultimate##0, L21, $Ultimate##0]don't care [183] 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] 150#[$Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0]don't care [217] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_71) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_71} OutVars{fooThread4of6ForFork0_thidvar0=v_fooThread4of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_71} AuxVars[] AssignedVars[fooThread4of6ForFork0_thidvar0] 214#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [183] 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] 324#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [218] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_73 v_fooThread5of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_73} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_73, fooThread5of6ForFork0_thidvar0=v_fooThread5of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread5of6ForFork0_thidvar0] 504#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [183] 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] 796#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [219] L20-1-->$Ultimate##0: Formula: (= v_fooThread6of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_75) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_75} OutVars{fooThread6of6ForFork0_thidvar0=v_fooThread6of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_75} AuxVars[] AssignedVars[fooThread6of6ForFork0_thidvar0] 1264#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [183] 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] 2018#[$Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [212] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3236#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,328 INFO L750 eck$LassoCheckResult]: Loop: 3236#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [213] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3236#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -986161796, now seen corresponding path program 1 times [2023-10-12 17:11:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125633953] [2023-10-12 17:11:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash 244, now seen corresponding path program 1 times [2023-10-12 17:11:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208888070] [2023-10-12 17:11:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -506244391, now seen corresponding path program 1 times [2023-10-12 17:11:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696448784] [2023-10-12 17:11:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,452 WARN L148 chiAutomizerObserver]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,459 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,466 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2023-10-12 17:11:59,467 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-10-12 17:11:59,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 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 86. Up to 8 conditions per place. [2023-10-12 17:11:59,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,468 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,469 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,469 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 159 flow [2023-10-12 17:11:59,473 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2023-10-12 17:11:59,473 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-10-12 17:11:59,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 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 86. Up to 8 conditions per place. [2023-10-12 17:11:59,475 INFO L119 LiptonReduction]: Number of co-enabled transitions 1064 [2023-10-12 17:11:59,689 INFO L134 LiptonReduction]: Checked pairs total: 2357 [2023-10-12 17:11:59,689 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:11:59,690 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,690 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,690 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,691 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,691 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,691 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,691 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,691 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:08,377 INFO L131 ngComponentsAnalysis]: Automaton has 16384 accepting balls. 16384 [2023-10-12 17:12:08,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:08,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:08,383 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:08,383 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:08,383 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:08,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 81918 states, but on-demand construction may add more states [2023-10-12 17:12:10,349 INFO L131 ngComponentsAnalysis]: Automaton has 16384 accepting balls. 16384 [2023-10-12 17:12:10,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,355 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:10,355 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:10,355 INFO L748 eck$LassoCheckResult]: Stem: 58#[$Ultimate##0]don't care [286] $Ultimate##0-->L20-1: Formula: (and (= v_ULTIMATE.start_newid_99 0) (= v_n_1198 0)) InVars {} OutVars{n=v_n_1198, ULTIMATE.start_newid=v_ULTIMATE.start_newid_99} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 61#[L20-1]don't care [272] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_86) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_86} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_86, fooThread1of7ForFork0_thidvar0=v_fooThread1of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of7ForFork0_thidvar0] 63#[L21, $Ultimate##0]don't care [237] 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] 71#[L20-1, $Ultimate##0]don't care [273] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_88 v_fooThread2of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_88} OutVars{fooThread2of7ForFork0_thidvar0=v_fooThread2of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_88} AuxVars[] AssignedVars[fooThread2of7ForFork0_thidvar0] 79#[L21, $Ultimate##0, $Ultimate##0]don't care [237] 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] 97#[$Ultimate##0, L20-1, $Ultimate##0]don't care [274] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_90) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_90} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_90, fooThread3of7ForFork0_thidvar0=v_fooThread3of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of7ForFork0_thidvar0] 121#[$Ultimate##0, L21, $Ultimate##0, $Ultimate##0]don't care [237] 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##0, $Ultimate##0, $Ultimate##0]don't care [275] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_92) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_92} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_92, fooThread4of7ForFork0_thidvar0=v_fooThread4of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of7ForFork0_thidvar0] 231#[$Ultimate##0, $Ultimate##0, L21, $Ultimate##0, $Ultimate##0]don't care [237] 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] 343#[L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [276] L20-1-->$Ultimate##0: Formula: (= v_fooThread5of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_94) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_94} OutVars{fooThread5of7ForFork0_thidvar0=v_fooThread5of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_94} AuxVars[] AssignedVars[fooThread5of7ForFork0_thidvar0] 519#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [237] 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] 807#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0]don't care [277] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_96 v_fooThread6of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_96} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_96, fooThread6of7ForFork0_thidvar0=v_fooThread6of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread6of7ForFork0_thidvar0] 1271#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L21, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [237] 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] 2023#[$Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [278] L20-1-->$Ultimate##0: Formula: (= v_fooThread7of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_98) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_98} OutVars{fooThread7of7ForFork0_thidvar0=v_fooThread7of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_98} AuxVars[] AssignedVars[fooThread7of7ForFork0_thidvar0] 3241#[L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [237] 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] 5211#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1]don't care [270] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8397#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:10,356 INFO L750 eck$LassoCheckResult]: Loop: 8397#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [271] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8397#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:10,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash 5697755, now seen corresponding path program 1 times [2023-10-12 17:12:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762586094] [2023-10-12 17:12:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash 302, now seen corresponding path program 1 times [2023-10-12 17:12:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370259447] [2023-10-12 17:12:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 176630676, now seen corresponding path program 1 times [2023-10-12 17:12:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646450624] [2023-10-12 17:12:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,470 WARN L148 chiAutomizerObserver]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:12:10,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:12:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,488 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2023-10-12 17:12:10,489 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-10-12 17:12:10,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 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 103. Up to 9 conditions per place. [2023-10-12 17:12:10,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,492 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:10,493 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,493 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 188 flow [2023-10-12 17:12:10,499 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2023-10-12 17:12:10,499 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-10-12 17:12:10,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 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 103. Up to 9 conditions per place. [2023-10-12 17:12:10,502 INFO L119 LiptonReduction]: Number of co-enabled transitions 1376 [2023-10-12 17:12:10,753 INFO L134 LiptonReduction]: Checked pairs total: 3111 [2023-10-12 17:12:10,753 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:12:10,757 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:10,757 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:10,757 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:10,758 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:10,758 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:10,758 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:10,758 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:10,759 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:10,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:01,006 INFO L131 ngComponentsAnalysis]: Automaton has 65536 accepting balls. 65536 [2023-10-12 17:13:01,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:01,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:01,027 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:01,027 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:01,027 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:01,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 327678 states, but on-demand construction may add more states [2023-10-12 17:13:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 65536 accepting balls. 65536 [2023-10-12 17:13:15,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:15,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:15,118 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:15,119 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:15,119 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]don't care [353] $Ultimate##0-->L20-1: Formula: (and (= v_ULTIMATE.start_newid_125 0) (= v_n_1621 0)) InVars {} OutVars{n=v_n_1621, ULTIMATE.start_newid=v_ULTIMATE.start_newid_125} AuxVars[] AssignedVars[n, ULTIMATE.start_newid] 68#[L20-1]don't care [337] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_110 v_fooThread1of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_110} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_110, fooThread1of8ForFork0_thidvar0=v_fooThread1of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of8ForFork0_thidvar0] 70#[$Ultimate##0, L21]don't care [298] 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] 76#[$Ultimate##0, L20-1]don't care [338] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_112 v_fooThread2of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_112} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_112, fooThread2of8ForFork0_thidvar0=v_fooThread2of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of8ForFork0_thidvar0] 82#[$Ultimate##0, $Ultimate##0, L21]don't care [298] 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] 98#[$Ultimate##0, $Ultimate##0, L20-1]don't care [339] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_114 v_fooThread3of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_114} OutVars{fooThread3of8ForFork0_thidvar0=v_fooThread3of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_114} AuxVars[] AssignedVars[fooThread3of8ForFork0_thidvar0] 122#[$Ultimate##0, L21, $Ultimate##0, $Ultimate##0]don't care [298] 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] 164#[$Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0]don't care [340] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_116 v_fooThread4of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_116} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_116, fooThread4of8ForFork0_thidvar0=v_fooThread4of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of8ForFork0_thidvar0] 226#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L21]don't care [298] 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] 332#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0]don't care [341] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_118 v_fooThread5of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_118} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_118, fooThread5of8ForFork0_thidvar0=v_fooThread5of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread5of8ForFork0_thidvar0] 504#[$Ultimate##0, $Ultimate##0, L21, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [298] 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] 790#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1]don't care [342] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_120 v_fooThread6of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_120} OutVars{fooThread6of8ForFork0_thidvar0=v_fooThread6of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_120} AuxVars[] AssignedVars[fooThread6of8ForFork0_thidvar0] 1248#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L21, $Ultimate##0, $Ultimate##0]don't care [298] 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] 1992#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0]don't care [343] L20-1-->$Ultimate##0: Formula: (= v_fooThread7of8ForFork0_thidvar0_2 v_ULTIMATE.start_newid_122) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_122} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_122, fooThread7of8ForFork0_thidvar0=v_fooThread7of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread7of8ForFork0_thidvar0] 3202#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L21]don't care [298] 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] 5180#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [344] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_124 v_fooThread8of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_124} OutVars{fooThread8of8ForFork0_thidvar0=v_fooThread8of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_124} AuxVars[] AssignedVars[fooThread8of8ForFork0_thidvar0] 8388#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L21, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [298] 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] 13572#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L20-1, $Ultimate##0]don't care [335] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 21940#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:13:15,119 INFO L750 eck$LassoCheckResult]: Loop: 21940#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [336] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 21940#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:13:15,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1047425827, now seen corresponding path program 1 times [2023-10-12 17:13:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:15,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746141483] [2023-10-12 17:13:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 367, now seen corresponding path program 1 times [2023-10-12 17:13:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879521969] [2023-10-12 17:13:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1889537395, now seen corresponding path program 1 times [2023-10-12 17:13:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995517421] [2023-10-12 17:13:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:15,255 WARN L148 chiAutomizerObserver]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:13:15,262 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:13:15,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,273 INFO L124 PetriNetUnfolderBase]: 1/68 cut-off events. [2023-10-12 17:13:15,273 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-10-12 17:13:15,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 68 events. 1/68 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 121. Up to 10 conditions per place. [2023-10-12 17:13:15,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,275 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:15,275 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,276 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 51 transitions, 219 flow [2023-10-12 17:13:15,286 INFO L124 PetriNetUnfolderBase]: 1/68 cut-off events. [2023-10-12 17:13:15,286 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-10-12 17:13:15,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 68 events. 1/68 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 121. Up to 10 conditions per place. [2023-10-12 17:13:15,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-10-12 17:13:15,603 INFO L134 LiptonReduction]: Checked pairs total: 3905 [2023-10-12 17:13:15,604 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-10-12 17:13:15,605 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:15,605 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:15,605 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:15,605 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:15,605 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:15,605 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:15,605 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:15,605 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:15,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states