./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:21:33,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:21:33,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:21:33,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:21:33,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:21:33,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:21:33,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:21:33,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:21:33,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:21:33,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:21:33,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:21:33,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:21:33,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:21:33,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:21:33,194 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:21:33,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:21:33,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:21:33,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:21:33,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:21:33,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:21:33,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:21:33,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:21:33,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:21:33,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:21:33,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:21:33,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:21:33,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:21:33,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:21:33,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:21:33,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:21:33,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:21:33,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:21:33,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:21:33,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:21:33,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:21:33,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:21:33,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:21:33,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:21:33,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:21:33,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:21:33,202 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:21:33,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:21:33,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:21:33,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 02:21:33,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:21:33,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:21:33,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:21:33,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:21:33,407 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:21:33,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-28 02:21:34,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:21:34,802 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:21:34,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-06-28 02:21:34,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99af444ea/3c9540cfdba445c3bc33bcdf406bffda/FLAG74b6cd38c [2024-06-28 02:21:34,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99af444ea/3c9540cfdba445c3bc33bcdf406bffda [2024-06-28 02:21:34,849 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:21:34,849 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:21:34,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/dekker.yml/witness.yml [2024-06-28 02:21:34,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:21:34,945 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:21:34,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:21:34,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:21:34,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:21:34,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:21:34" (1/2) ... [2024-06-28 02:21:34,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b7bf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:21:34, skipping insertion in model container [2024-06-28 02:21:34,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:21:34" (1/2) ... [2024-06-28 02:21:34,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d081fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:21:34, skipping insertion in model container [2024-06-28 02:21:34,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:21:34" (2/2) ... [2024-06-28 02:21:34,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b7bf35 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:34, skipping insertion in model container [2024-06-28 02:21:34,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:21:34" (2/2) ... [2024-06-28 02:21:34,957 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:21:34,988 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:21:34,990 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((! multithreaded || (flag2 == 0 || flag2 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((flag1 == 0 || flag1 == 1) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || (flag1 == 0 || flag1 == 1)) [2024-06-28 02:21:34,990 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((! multithreaded || (flag2 == 0 || flag2 == 1)) && (! multithreaded || (turn == 0 || turn == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (((flag1 == 0 || flag1 == 1) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || (flag1 == 0 || flag1 == 1)) [2024-06-28 02:21:34,990 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:21:34,990 INFO L106 edCorrectnessWitness]: ghost_update [L792-L792] multithreaded = 1; [2024-06-28 02:21:35,030 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:21:35,317 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:21:35,324 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:21:35,398 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:21:35,428 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:21:35,429 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35 WrapperNode [2024-06-28 02:21:35,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:21:35,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:21:35,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:21:35,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:21:35,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,488 INFO L138 Inliner]: procedures = 170, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2024-06-28 02:21:35,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:21:35,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:21:35,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:21:35,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:21:35,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,529 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 02:21:35,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:21:35,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:21:35,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:21:35,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:21:35,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (1/1) ... [2024-06-28 02:21:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:21:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:21:35,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:21:35,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:21:35,610 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-06-28 02:21:35,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-06-28 02:21:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-28 02:21:35,611 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-28 02:21:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:21:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:21:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:21:35,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:21:35,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:21:35,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:21:35,613 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:21:35,727 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:21:35,729 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:21:35,855 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:21:35,855 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:21:35,958 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:21:35,959 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 02:21:35,959 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:21:35 BoogieIcfgContainer [2024-06-28 02:21:35,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:21:35,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:21:35,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:21:35,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:21:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:21:34" (1/4) ... [2024-06-28 02:21:35,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe6dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:21:35, skipping insertion in model container [2024-06-28 02:21:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:21:34" (2/4) ... [2024-06-28 02:21:35,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe6dab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:21:35, skipping insertion in model container [2024-06-28 02:21:35,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:21:35" (3/4) ... [2024-06-28 02:21:35,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe6dab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:21:35, skipping insertion in model container [2024-06-28 02:21:35,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:21:35" (4/4) ... [2024-06-28 02:21:35,980 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-06-28 02:21:35,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:21:35,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-28 02:21:35,994 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:21:36,031 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 02:21:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 120 flow [2024-06-28 02:21:36,098 INFO L124 PetriNetUnfolderBase]: 6/51 cut-off events. [2024-06-28 02:21:36,099 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 02:21:36,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 51 events. 6/51 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-06-28 02:21:36,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 53 transitions, 120 flow [2024-06-28 02:21:36,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 49 transitions, 107 flow [2024-06-28 02:21:36,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:21:36,116 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1376ad82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:21:36,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-28 02:21:36,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:21:36,118 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:21:36,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:21:36,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:36,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:21:36,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:36,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 287084175, now seen corresponding path program 1 times [2024-06-28 02:21:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560385571] [2024-06-28 02:21:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:36,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560385571] [2024-06-28 02:21:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560385571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:36,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:21:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668113623] [2024-06-28 02:21:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:36,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:21:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:21:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:21:36,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 53 [2024-06-28 02:21:36,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:36,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:36,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 53 [2024-06-28 02:21:36,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:36,630 INFO L124 PetriNetUnfolderBase]: 363/924 cut-off events. [2024-06-28 02:21:36,630 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-28 02:21:36,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 924 events. 363/924 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5290 event pairs, 126 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 1332. Up to 434 conditions per place. [2024-06-28 02:21:36,639 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 24 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-06-28 02:21:36,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 176 flow [2024-06-28 02:21:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:21:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:21:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 02:21:36,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2024-06-28 02:21:36,651 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 107 flow. Second operand 3 states and 119 transitions. [2024-06-28 02:21:36,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 176 flow [2024-06-28 02:21:36,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:36,658 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 123 flow [2024-06-28 02:21:36,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2024-06-28 02:21:36,663 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2024-06-28 02:21:36,663 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 123 flow [2024-06-28 02:21:36,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:36,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:36,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:36,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:21:36,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:36,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1010048590, now seen corresponding path program 1 times [2024-06-28 02:21:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000812479] [2024-06-28 02:21:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000812479] [2024-06-28 02:21:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000812479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:21:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912358953] [2024-06-28 02:21:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:36,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:36,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2024-06-28 02:21:36,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:36,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:36,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2024-06-28 02:21:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:36,985 INFO L124 PetriNetUnfolderBase]: 428/1026 cut-off events. [2024-06-28 02:21:36,985 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-06-28 02:21:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 1026 events. 428/1026 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5930 event pairs, 137 based on Foata normal form. 4/960 useless extension candidates. Maximal degree in co-relation 1464. Up to 498 conditions per place. [2024-06-28 02:21:36,992 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 34 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2024-06-28 02:21:36,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 253 flow [2024-06-28 02:21:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:21:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:21:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-06-28 02:21:36,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7311320754716981 [2024-06-28 02:21:36,999 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 123 flow. Second operand 4 states and 155 transitions. [2024-06-28 02:21:36,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 253 flow [2024-06-28 02:21:37,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:37,002 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 173 flow [2024-06-28 02:21:37,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2024-06-28 02:21:37,004 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-06-28 02:21:37,004 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 173 flow [2024-06-28 02:21:37,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:37,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:37,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:21:37,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:37,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash -181302327, now seen corresponding path program 1 times [2024-06-28 02:21:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:37,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140424195] [2024-06-28 02:21:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140424195] [2024-06-28 02:21:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140424195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605096848] [2024-06-28 02:21:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:37,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:37,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:37,419 INFO L124 PetriNetUnfolderBase]: 578/1248 cut-off events. [2024-06-28 02:21:37,419 INFO L125 PetriNetUnfolderBase]: For 400/408 co-relation queries the response was YES. [2024-06-28 02:21:37,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1248 events. 578/1248 cut-off events. For 400/408 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7485 event pairs, 121 based on Foata normal form. 10/1167 useless extension candidates. Maximal degree in co-relation 1831. Up to 382 conditions per place. [2024-06-28 02:21:37,428 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 49 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-06-28 02:21:37,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 437 flow [2024-06-28 02:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-06-28 02:21:37,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2024-06-28 02:21:37,430 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 173 flow. Second operand 6 states and 224 transitions. [2024-06-28 02:21:37,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 437 flow [2024-06-28 02:21:37,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 433 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:21:37,434 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 303 flow [2024-06-28 02:21:37,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2024-06-28 02:21:37,435 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-06-28 02:21:37,435 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 303 flow [2024-06-28 02:21:37,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:37,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:37,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:21:37,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:37,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1740139219, now seen corresponding path program 1 times [2024-06-28 02:21:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53379292] [2024-06-28 02:21:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53379292] [2024-06-28 02:21:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53379292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:37,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:21:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507029936] [2024-06-28 02:21:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:37,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:37,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2024-06-28 02:21:37,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:37,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2024-06-28 02:21:37,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:37,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([273] L794-->ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse3 (not (= v_~flag2~0_10 0))) (.cse4 (not (= v_~flag2~0_10 1))) (.cse0 (not (= v_~turn~0_13 0))) (.cse2 (not (= v_~turn~0_13 1))) (.cse5 (not (= v_~flag1~0_10 0))) (.cse1 (not (= |v_#ghost~multithreaded_4| 0))) (.cse6 (not (= v_~flag1~0_10 1)))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 (or (and .cse5 .cse6) (and .cse3 .cse4) (and .cse0 .cse2))) (and .cse1 (not (= v_~x~0_10 1)) (not (= v_~x~0_10 0))) (and .cse5 .cse1 .cse6))) InVars {~flag1~0=v_~flag1~0_10, #ghost~multithreaded=|v_#ghost~multithreaded_4|, ~turn~0=v_~turn~0_13, ~x~0=v_~x~0_10, ~flag2~0=v_~flag2~0_10} OutVars{~flag1~0=v_~flag1~0_10, #ghost~multithreaded=|v_#ghost~multithreaded_4|, ~turn~0=v_~turn~0_13, ~x~0=v_~x~0_10, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[][42], [Black: 63#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 77#true, Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 69#(= ~flag2~0 0), 34#L721true, 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 61#true, thr2Thread1of1ForFork0InUse, 35#thr2EXITtrue, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:37,661 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 02:21:37,661 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 02:21:37,661 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 02:21:37,661 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 02:21:37,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L728-->L725-1: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_13| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} AuxVars[] AssignedVars[][48], [Black: 63#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 30#L793-5true, Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 77#true, Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), 43#L725-1true, Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 69#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 61#true, 35#thr2EXITtrue, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:37,662 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-28 02:21:37,662 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 02:21:37,662 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-28 02:21:37,662 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-06-28 02:21:37,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L728-->L725-1: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_13| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_13|} AuxVars[] AssignedVars[][48], [Black: 63#(and (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 24#L794true, 77#true, Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), 43#L725-1true, Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), 69#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 61#true, 35#thr2EXITtrue, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:37,663 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-28 02:21:37,663 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-28 02:21:37,663 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:37,663 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:37,664 INFO L124 PetriNetUnfolderBase]: 550/1226 cut-off events. [2024-06-28 02:21:37,664 INFO L125 PetriNetUnfolderBase]: For 1324/1340 co-relation queries the response was YES. [2024-06-28 02:21:37,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 1226 events. 550/1226 cut-off events. For 1324/1340 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7231 event pairs, 130 based on Foata normal form. 4/1130 useless extension candidates. Maximal degree in co-relation 2727. Up to 680 conditions per place. [2024-06-28 02:21:37,671 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 42 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2024-06-28 02:21:37,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 451 flow [2024-06-28 02:21:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:21:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:21:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-06-28 02:21:37,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7028301886792453 [2024-06-28 02:21:37,672 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 303 flow. Second operand 4 states and 149 transitions. [2024-06-28 02:21:37,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 451 flow [2024-06-28 02:21:37,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 430 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:37,677 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 347 flow [2024-06-28 02:21:37,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-06-28 02:21:37,677 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2024-06-28 02:21:37,678 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 347 flow [2024-06-28 02:21:37,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:37,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:37,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:21:37,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:37,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1325402583, now seen corresponding path program 1 times [2024-06-28 02:21:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966389100] [2024-06-28 02:21:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966389100] [2024-06-28 02:21:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966389100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565624137] [2024-06-28 02:21:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:37,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:37,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:37,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:37,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:37,937 INFO L124 PetriNetUnfolderBase]: 631/1314 cut-off events. [2024-06-28 02:21:37,937 INFO L125 PetriNetUnfolderBase]: For 2047/2102 co-relation queries the response was YES. [2024-06-28 02:21:37,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 1314 events. 631/1314 cut-off events. For 2047/2102 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7918 event pairs, 75 based on Foata normal form. 24/1258 useless extension candidates. Maximal degree in co-relation 2821. Up to 327 conditions per place. [2024-06-28 02:21:37,945 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 58 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2024-06-28 02:21:37,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 647 flow [2024-06-28 02:21:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2024-06-28 02:21:37,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7075471698113207 [2024-06-28 02:21:37,947 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 347 flow. Second operand 6 states and 225 transitions. [2024-06-28 02:21:37,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 647 flow [2024-06-28 02:21:37,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 638 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:37,951 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 470 flow [2024-06-28 02:21:37,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-28 02:21:37,952 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2024-06-28 02:21:37,952 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 470 flow [2024-06-28 02:21:37,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:37,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:37,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:37,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:21:37,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:37,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash 419882604, now seen corresponding path program 1 times [2024-06-28 02:21:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151391720] [2024-06-28 02:21:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151391720] [2024-06-28 02:21:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151391720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:38,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:38,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863118551] [2024-06-28 02:21:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:38,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:21:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:21:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:21:38,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:38,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:38,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:38,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:38,185 INFO L124 PetriNetUnfolderBase]: 666/1400 cut-off events. [2024-06-28 02:21:38,185 INFO L125 PetriNetUnfolderBase]: For 3623/3723 co-relation queries the response was YES. [2024-06-28 02:21:38,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 1400 events. 666/1400 cut-off events. For 3623/3723 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8129 event pairs, 157 based on Foata normal form. 25/1330 useless extension candidates. Maximal degree in co-relation 3808. Up to 633 conditions per place. [2024-06-28 02:21:38,194 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 63 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-28 02:21:38,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 859 flow [2024-06-28 02:21:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-06-28 02:21:38,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7094339622641509 [2024-06-28 02:21:38,196 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 470 flow. Second operand 5 states and 188 transitions. [2024-06-28 02:21:38,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 859 flow [2024-06-28 02:21:38,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 114 transitions, 816 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 02:21:38,203 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 650 flow [2024-06-28 02:21:38,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=650, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2024-06-28 02:21:38,204 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2024-06-28 02:21:38,204 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 650 flow [2024-06-28 02:21:38,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:38,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:38,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:21:38,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:38,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash -443807346, now seen corresponding path program 2 times [2024-06-28 02:21:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324345310] [2024-06-28 02:21:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:38,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:38,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324345310] [2024-06-28 02:21:38,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324345310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:38,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:38,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824692698] [2024-06-28 02:21:38,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:38,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:21:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:21:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:21:38,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:38,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:38,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:38,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:38,429 INFO L124 PetriNetUnfolderBase]: 653/1363 cut-off events. [2024-06-28 02:21:38,430 INFO L125 PetriNetUnfolderBase]: For 5167/5298 co-relation queries the response was YES. [2024-06-28 02:21:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4771 conditions, 1363 events. 653/1363 cut-off events. For 5167/5298 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8199 event pairs, 163 based on Foata normal form. 62/1337 useless extension candidates. Maximal degree in co-relation 3297. Up to 630 conditions per place. [2024-06-28 02:21:38,439 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 61 selfloop transitions, 28 changer transitions 0/113 dead transitions. [2024-06-28 02:21:38,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 113 transitions, 955 flow [2024-06-28 02:21:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-28 02:21:38,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7018867924528301 [2024-06-28 02:21:38,440 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 650 flow. Second operand 5 states and 186 transitions. [2024-06-28 02:21:38,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 113 transitions, 955 flow [2024-06-28 02:21:38,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 113 transitions, 939 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-28 02:21:38,448 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 772 flow [2024-06-28 02:21:38,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=772, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-06-28 02:21:38,449 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2024-06-28 02:21:38,449 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 772 flow [2024-06-28 02:21:38,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:38,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:38,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:21:38,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:38,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 514154386, now seen corresponding path program 1 times [2024-06-28 02:21:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348573402] [2024-06-28 02:21:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:38,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348573402] [2024-06-28 02:21:38,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348573402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:38,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555215124] [2024-06-28 02:21:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:38,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:38,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 53 [2024-06-28 02:21:38,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:38,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 53 [2024-06-28 02:21:38,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:38,648 INFO L124 PetriNetUnfolderBase]: 695/1546 cut-off events. [2024-06-28 02:21:38,649 INFO L125 PetriNetUnfolderBase]: For 6501/6669 co-relation queries the response was YES. [2024-06-28 02:21:38,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 1546 events. 695/1546 cut-off events. For 6501/6669 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10214 event pairs, 132 based on Foata normal form. 50/1460 useless extension candidates. Maximal degree in co-relation 5286. Up to 280 conditions per place. [2024-06-28 02:21:38,659 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 42 selfloop transitions, 34 changer transitions 0/124 dead transitions. [2024-06-28 02:21:38,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1028 flow [2024-06-28 02:21:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-06-28 02:21:38,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7660377358490567 [2024-06-28 02:21:38,660 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 772 flow. Second operand 5 states and 203 transitions. [2024-06-28 02:21:38,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1028 flow [2024-06-28 02:21:38,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 124 transitions, 998 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-28 02:21:38,670 INFO L231 Difference]: Finished difference. Result has 90 places, 104 transitions, 909 flow [2024-06-28 02:21:38,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=909, PETRI_PLACES=90, PETRI_TRANSITIONS=104} [2024-06-28 02:21:38,671 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2024-06-28 02:21:38,671 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 909 flow [2024-06-28 02:21:38,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:38,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:38,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:21:38,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:38,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1531493589, now seen corresponding path program 1 times [2024-06-28 02:21:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:38,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443744906] [2024-06-28 02:21:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:38,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443744906] [2024-06-28 02:21:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443744906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187161494] [2024-06-28 02:21:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:38,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:21:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:21:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:21:38,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2024-06-28 02:21:38,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 909 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:38,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2024-06-28 02:21:38,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:38,966 INFO L124 PetriNetUnfolderBase]: 849/1783 cut-off events. [2024-06-28 02:21:38,967 INFO L125 PetriNetUnfolderBase]: For 10977/11165 co-relation queries the response was YES. [2024-06-28 02:21:38,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 1783 events. 849/1783 cut-off events. For 10977/11165 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11254 event pairs, 255 based on Foata normal form. 24/1696 useless extension candidates. Maximal degree in co-relation 6850. Up to 1173 conditions per place. [2024-06-28 02:21:38,979 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 71 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2024-06-28 02:21:38,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 114 transitions, 1113 flow [2024-06-28 02:21:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-06-28 02:21:38,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6754716981132075 [2024-06-28 02:21:38,981 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 909 flow. Second operand 5 states and 179 transitions. [2024-06-28 02:21:38,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 114 transitions, 1113 flow [2024-06-28 02:21:38,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 1111 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 02:21:38,991 INFO L231 Difference]: Finished difference. Result has 95 places, 106 transitions, 946 flow [2024-06-28 02:21:38,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=95, PETRI_TRANSITIONS=106} [2024-06-28 02:21:38,992 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2024-06-28 02:21:38,992 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 106 transitions, 946 flow [2024-06-28 02:21:38,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:38,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:38,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:38,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:21:38,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:38,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -231660327, now seen corresponding path program 1 times [2024-06-28 02:21:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:38,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131935964] [2024-06-28 02:21:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131935964] [2024-06-28 02:21:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131935964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126101130] [2024-06-28 02:21:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:39,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:39,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:39,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:39,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 106 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:39,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:39,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:39,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:39,344 INFO L124 PetriNetUnfolderBase]: 1014/2057 cut-off events. [2024-06-28 02:21:39,344 INFO L125 PetriNetUnfolderBase]: For 13422/13632 co-relation queries the response was YES. [2024-06-28 02:21:39,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8295 conditions, 2057 events. 1014/2057 cut-off events. For 13422/13632 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13175 event pairs, 234 based on Foata normal form. 32/1963 useless extension candidates. Maximal degree in co-relation 7530. Up to 754 conditions per place. [2024-06-28 02:21:39,357 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 78 selfloop transitions, 40 changer transitions 2/146 dead transitions. [2024-06-28 02:21:39,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 146 transitions, 1476 flow [2024-06-28 02:21:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-06-28 02:21:39,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2024-06-28 02:21:39,359 INFO L175 Difference]: Start difference. First operand has 95 places, 106 transitions, 946 flow. Second operand 6 states and 218 transitions. [2024-06-28 02:21:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 146 transitions, 1476 flow [2024-06-28 02:21:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 146 transitions, 1453 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:39,372 INFO L231 Difference]: Finished difference. Result has 101 places, 119 transitions, 1219 flow [2024-06-28 02:21:39,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1219, PETRI_PLACES=101, PETRI_TRANSITIONS=119} [2024-06-28 02:21:39,373 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2024-06-28 02:21:39,373 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 119 transitions, 1219 flow [2024-06-28 02:21:39,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:39,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:39,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:39,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:21:39,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:39,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1633179434, now seen corresponding path program 1 times [2024-06-28 02:21:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882382881] [2024-06-28 02:21:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882382881] [2024-06-28 02:21:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882382881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393119991] [2024-06-28 02:21:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:39,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:39,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 53 [2024-06-28 02:21:39,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 119 transitions, 1219 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:39,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:39,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 53 [2024-06-28 02:21:39,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:39,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][55], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:39,621 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-28 02:21:39,622 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:39,622 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:39,622 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:39,691 INFO L124 PetriNetUnfolderBase]: 1101/2524 cut-off events. [2024-06-28 02:21:39,691 INFO L125 PetriNetUnfolderBase]: For 15113/15252 co-relation queries the response was YES. [2024-06-28 02:21:39,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9626 conditions, 2524 events. 1101/2524 cut-off events. For 15113/15252 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18985 event pairs, 274 based on Foata normal form. 87/2373 useless extension candidates. Maximal degree in co-relation 9061. Up to 568 conditions per place. [2024-06-28 02:21:39,711 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 41 selfloop transitions, 32 changer transitions 0/148 dead transitions. [2024-06-28 02:21:39,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 1531 flow [2024-06-28 02:21:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-06-28 02:21:39,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7660377358490567 [2024-06-28 02:21:39,713 INFO L175 Difference]: Start difference. First operand has 101 places, 119 transitions, 1219 flow. Second operand 5 states and 203 transitions. [2024-06-28 02:21:39,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 1531 flow [2024-06-28 02:21:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 148 transitions, 1477 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:39,739 INFO L231 Difference]: Finished difference. Result has 107 places, 130 transitions, 1389 flow [2024-06-28 02:21:39,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1389, PETRI_PLACES=107, PETRI_TRANSITIONS=130} [2024-06-28 02:21:39,740 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2024-06-28 02:21:39,740 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 1389 flow [2024-06-28 02:21:39,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:39,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:39,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:21:39,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:39,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -204566626, now seen corresponding path program 2 times [2024-06-28 02:21:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66819911] [2024-06-28 02:21:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66819911] [2024-06-28 02:21:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66819911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366946528] [2024-06-28 02:21:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:39,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:39,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:39,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 1389 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:39,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:39,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:40,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][59], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 30#L793-5true, Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,146 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 02:21:40,146 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:40,147 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:40,147 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:40,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][59], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), 24#L794true, Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,151 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 02:21:40,151 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:40,151 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:40,151 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:21:40,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][59], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,157 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 02:21:40,157 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:40,158 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:40,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:40,164 INFO L124 PetriNetUnfolderBase]: 1359/2834 cut-off events. [2024-06-28 02:21:40,165 INFO L125 PetriNetUnfolderBase]: For 24748/25127 co-relation queries the response was YES. [2024-06-28 02:21:40,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13009 conditions, 2834 events. 1359/2834 cut-off events. For 24748/25127 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20502 event pairs, 399 based on Foata normal form. 103/2751 useless extension candidates. Maximal degree in co-relation 10123. Up to 1288 conditions per place. [2024-06-28 02:21:40,186 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2024-06-28 02:21:40,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 157 transitions, 1838 flow [2024-06-28 02:21:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-06-28 02:21:40,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2024-06-28 02:21:40,187 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 1389 flow. Second operand 6 states and 219 transitions. [2024-06-28 02:21:40,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 157 transitions, 1838 flow [2024-06-28 02:21:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 1838 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:21:40,219 INFO L231 Difference]: Finished difference. Result has 114 places, 140 transitions, 1617 flow [2024-06-28 02:21:40,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1617, PETRI_PLACES=114, PETRI_TRANSITIONS=140} [2024-06-28 02:21:40,220 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 64 predicate places. [2024-06-28 02:21:40,220 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 140 transitions, 1617 flow [2024-06-28 02:21:40,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:40,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:40,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:40,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:21:40,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:40,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1408478058, now seen corresponding path program 3 times [2024-06-28 02:21:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:40,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492513812] [2024-06-28 02:21:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:40,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492513812] [2024-06-28 02:21:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492513812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988204124] [2024-06-28 02:21:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:40,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:40,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:40,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 140 transitions, 1617 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:40,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:40,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:40,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:40,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 30#L793-5true, Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, 151#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,611 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 02:21:40,611 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:40,611 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:40,611 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:40,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 24#L794true, Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 151#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,615 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 02:21:40,615 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:40,615 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:21:40,616 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:40,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, 151#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:40,623 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 02:21:40,623 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:40,623 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:40,623 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:40,631 INFO L124 PetriNetUnfolderBase]: 1353/2830 cut-off events. [2024-06-28 02:21:40,631 INFO L125 PetriNetUnfolderBase]: For 30134/30539 co-relation queries the response was YES. [2024-06-28 02:21:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13801 conditions, 2830 events. 1353/2830 cut-off events. For 30134/30539 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20572 event pairs, 396 based on Foata normal form. 113/2757 useless extension candidates. Maximal degree in co-relation 10748. Up to 1288 conditions per place. [2024-06-28 02:21:40,654 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 86 selfloop transitions, 44 changer transitions 0/159 dead transitions. [2024-06-28 02:21:40,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 2009 flow [2024-06-28 02:21:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-06-28 02:21:40,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2024-06-28 02:21:40,655 INFO L175 Difference]: Start difference. First operand has 114 places, 140 transitions, 1617 flow. Second operand 6 states and 219 transitions. [2024-06-28 02:21:40,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 2009 flow [2024-06-28 02:21:40,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 1959 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:40,702 INFO L231 Difference]: Finished difference. Result has 119 places, 142 transitions, 1681 flow [2024-06-28 02:21:40,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1681, PETRI_PLACES=119, PETRI_TRANSITIONS=142} [2024-06-28 02:21:40,703 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 69 predicate places. [2024-06-28 02:21:40,703 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 1681 flow [2024-06-28 02:21:40,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:40,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:40,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:40,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:21:40,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:40,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1408465224, now seen corresponding path program 1 times [2024-06-28 02:21:40,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:40,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828937518] [2024-06-28 02:21:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828937518] [2024-06-28 02:21:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828937518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544557761] [2024-06-28 02:21:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:40,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:40,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:40,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 1681 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:40,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:40,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:40,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:41,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 30#L793-5true, Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 151#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,118 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 02:21:41,118 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:41,118 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:41,118 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:41,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), 24#L794true, Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, 151#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,123 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 02:21:41,123 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:41,123 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:41,123 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:21:41,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][58], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 151#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,130 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 02:21:41,130 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:41,130 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:41,130 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:41,137 INFO L124 PetriNetUnfolderBase]: 1437/3017 cut-off events. [2024-06-28 02:21:41,137 INFO L125 PetriNetUnfolderBase]: For 35907/36297 co-relation queries the response was YES. [2024-06-28 02:21:41,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15067 conditions, 3017 events. 1437/3017 cut-off events. For 35907/36297 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22298 event pairs, 336 based on Foata normal form. 48/2873 useless extension candidates. Maximal degree in co-relation 14088. Up to 952 conditions per place. [2024-06-28 02:21:41,162 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 93 selfloop transitions, 50 changer transitions 3/175 dead transitions. [2024-06-28 02:21:41,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 2225 flow [2024-06-28 02:21:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-28 02:21:41,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6823899371069182 [2024-06-28 02:21:41,163 INFO L175 Difference]: Start difference. First operand has 119 places, 142 transitions, 1681 flow. Second operand 6 states and 217 transitions. [2024-06-28 02:21:41,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 2225 flow [2024-06-28 02:21:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 175 transitions, 2169 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 02:21:41,209 INFO L231 Difference]: Finished difference. Result has 126 places, 149 transitions, 1882 flow [2024-06-28 02:21:41,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1882, PETRI_PLACES=126, PETRI_TRANSITIONS=149} [2024-06-28 02:21:41,209 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 76 predicate places. [2024-06-28 02:21:41,209 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 149 transitions, 1882 flow [2024-06-28 02:21:41,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:41,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:41,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:41,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:21:41,210 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:41,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -288833595, now seen corresponding path program 1 times [2024-06-28 02:21:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127550417] [2024-06-28 02:21:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127550417] [2024-06-28 02:21:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127550417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:41,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:41,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954843297] [2024-06-28 02:21:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:41,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:41,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:41,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:41,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 149 transitions, 1882 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:41,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][65], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 30#L793-5true, Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 168#true, Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,669 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 02:21:41,669 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:41,670 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:41,670 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:41,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][65], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), 24#L794true, Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 168#true, Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,676 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 02:21:41,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:41,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:41,676 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:21:41,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][65], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), 168#true, Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:41,684 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 02:21:41,684 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:41,684 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:41,685 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:41,694 INFO L124 PetriNetUnfolderBase]: 1510/3162 cut-off events. [2024-06-28 02:21:41,695 INFO L125 PetriNetUnfolderBase]: For 43083/43478 co-relation queries the response was YES. [2024-06-28 02:21:41,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16610 conditions, 3162 events. 1510/3162 cut-off events. For 43083/43478 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23481 event pairs, 391 based on Foata normal form. 80/3055 useless extension candidates. Maximal degree in co-relation 15556. Up to 1237 conditions per place. [2024-06-28 02:21:41,726 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 97 selfloop transitions, 65 changer transitions 0/191 dead transitions. [2024-06-28 02:21:41,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 191 transitions, 2628 flow [2024-06-28 02:21:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2024-06-28 02:21:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2024-06-28 02:21:41,728 INFO L175 Difference]: Start difference. First operand has 126 places, 149 transitions, 1882 flow. Second operand 6 states and 226 transitions. [2024-06-28 02:21:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 191 transitions, 2628 flow [2024-06-28 02:21:41,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 191 transitions, 2567 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:41,806 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 2096 flow [2024-06-28 02:21:41,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2096, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2024-06-28 02:21:41,807 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 82 predicate places. [2024-06-28 02:21:41,808 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 2096 flow [2024-06-28 02:21:41,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:41,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:41,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:41,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:21:41,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:41,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -289576665, now seen corresponding path program 2 times [2024-06-28 02:21:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843330936] [2024-06-28 02:21:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:41,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843330936] [2024-06-28 02:21:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843330936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:41,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:41,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536437179] [2024-06-28 02:21:41,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:41,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:41,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:41,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 2096 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:41,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:41,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:41,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:42,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][64], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), 30#L793-5true, Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 168#true, Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), Black: 171#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 173#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), 143#true, thr2Thread1of1ForFork0InUse, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 176#true]) [2024-06-28 02:21:42,317 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-06-28 02:21:42,317 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-28 02:21:42,317 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:42,317 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-28 02:21:42,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][64], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), 24#L794true, Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), 168#true, Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), 16#L777true, Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), 108#true, Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 125#(= ~flag1~0 0), Black: 171#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 173#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), 176#true]) [2024-06-28 02:21:42,322 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-28 02:21:42,322 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:42,322 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-28 02:21:42,323 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-28 02:21:42,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([308] L742-->L745: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0][64], [Black: 128#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~x~0 1)), Black: 127#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~x~0 1)), Black: 64#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 126#(and (= ~flag1~0 0) (= ~flag2~0 1)), 18#L745true, Black: 69#(= ~flag2~0 0), Black: 72#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 70#(and (= ~flag1~0 1) (= ~flag2~0 0)), Black: 71#(and (= ~x~0 0) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 138#(and (= |thr2Thread1of1ForFork0_~f1~0#1| 1) (= ~flag1~0 1)), Black: 135#(= ~flag1~0 1), Black: 80#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 79#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0)), 101#true, Black: 146#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 148#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 85#(= ~flag2~0 0), 168#true, Black: 88#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 86#(and (= ~x~0 0) (= ~flag2~0 0)), Black: 87#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 156#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 96#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0)), Black: 97#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 161#(and (= ~flag1~0 0) (= ~x~0 1)), Black: 95#(and (= ~x~0 0) (= ~turn~0 0)), Black: 162#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1)), 16#L777true, Black: 163#(and (= ~flag1~0 0) (= ~turn~0 1) (= ~x~0 1) (= ~flag2~0 0)), Black: 103#(and (= ~x~0 0) (= ~turn~0 0)), Black: 105#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 108#true, 125#(= ~flag1~0 0), Black: 171#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 173#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 136#(= |thr2Thread1of1ForFork0_~f1~0#1| 1), Black: 113#(and (= |thr1Thread1of1ForFork1_~f2~0#1| 0) (= ~flag2~0 0)), 25#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 111#(= |thr1Thread1of1ForFork1_~f2~0#1| 0), Black: 110#(= ~flag2~0 0), thr2Thread1of1ForFork0InUse, 143#true, 160#(= ~flag1~0 0), Black: 121#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 93#true, 176#true, Black: 59#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0))]) [2024-06-28 02:21:42,329 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-28 02:21:42,329 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:42,329 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-28 02:21:42,329 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-28 02:21:42,336 INFO L124 PetriNetUnfolderBase]: 1541/3207 cut-off events. [2024-06-28 02:21:42,336 INFO L125 PetriNetUnfolderBase]: For 49140/49678 co-relation queries the response was YES. [2024-06-28 02:21:42,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 3207 events. 1541/3207 cut-off events. For 49140/49678 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23810 event pairs, 415 based on Foata normal form. 91/3108 useless extension candidates. Maximal degree in co-relation 16812. Up to 1256 conditions per place. [2024-06-28 02:21:42,363 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 95 selfloop transitions, 67 changer transitions 0/191 dead transitions. [2024-06-28 02:21:42,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 191 transitions, 2817 flow [2024-06-28 02:21:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-06-28 02:21:42,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-06-28 02:21:42,365 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 2096 flow. Second operand 6 states and 216 transitions. [2024-06-28 02:21:42,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 191 transitions, 2817 flow [2024-06-28 02:21:42,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 191 transitions, 2649 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:42,424 INFO L231 Difference]: Finished difference. Result has 137 places, 165 transitions, 2296 flow [2024-06-28 02:21:42,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2296, PETRI_PLACES=137, PETRI_TRANSITIONS=165} [2024-06-28 02:21:42,425 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 87 predicate places. [2024-06-28 02:21:42,425 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 165 transitions, 2296 flow [2024-06-28 02:21:42,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:42,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:42,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:21:42,425 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:42,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash -892584945, now seen corresponding path program 3 times [2024-06-28 02:21:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602891834] [2024-06-28 02:21:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602891834] [2024-06-28 02:21:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602891834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29199197] [2024-06-28 02:21:42,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:42,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:42,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:42,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 165 transitions, 2296 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:42,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:42,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:42,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:42,874 INFO L124 PetriNetUnfolderBase]: 1550/3231 cut-off events. [2024-06-28 02:21:42,874 INFO L125 PetriNetUnfolderBase]: For 53798/54439 co-relation queries the response was YES. [2024-06-28 02:21:42,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18483 conditions, 3231 events. 1550/3231 cut-off events. For 53798/54439 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23947 event pairs, 496 based on Foata normal form. 107/3148 useless extension candidates. Maximal degree in co-relation 17416. Up to 1267 conditions per place. [2024-06-28 02:21:42,946 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 82 selfloop transitions, 74 changer transitions 0/185 dead transitions. [2024-06-28 02:21:42,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 185 transitions, 2833 flow [2024-06-28 02:21:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-06-28 02:21:42,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2024-06-28 02:21:42,948 INFO L175 Difference]: Start difference. First operand has 137 places, 165 transitions, 2296 flow. Second operand 6 states and 206 transitions. [2024-06-28 02:21:42,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 185 transitions, 2833 flow [2024-06-28 02:21:43,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 185 transitions, 2724 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-28 02:21:43,181 INFO L231 Difference]: Finished difference. Result has 142 places, 172 transitions, 2514 flow [2024-06-28 02:21:43,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2514, PETRI_PLACES=142, PETRI_TRANSITIONS=172} [2024-06-28 02:21:43,182 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 92 predicate places. [2024-06-28 02:21:43,182 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 172 transitions, 2514 flow [2024-06-28 02:21:43,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:43,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:43,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:21:43,183 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:43,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2046597434, now seen corresponding path program 1 times [2024-06-28 02:21:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434764093] [2024-06-28 02:21:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434764093] [2024-06-28 02:21:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434764093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340195378] [2024-06-28 02:21:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:43,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:43,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:43,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 172 transitions, 2514 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:43,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:43,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:43,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:43,691 INFO L124 PetriNetUnfolderBase]: 1528/3205 cut-off events. [2024-06-28 02:21:43,692 INFO L125 PetriNetUnfolderBase]: For 58798/59487 co-relation queries the response was YES. [2024-06-28 02:21:43,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18737 conditions, 3205 events. 1528/3205 cut-off events. For 58798/59487 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23931 event pairs, 493 based on Foata normal form. 131/3148 useless extension candidates. Maximal degree in co-relation 16387. Up to 1287 conditions per place. [2024-06-28 02:21:43,722 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 84 selfloop transitions, 85 changer transitions 0/198 dead transitions. [2024-06-28 02:21:43,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 198 transitions, 3179 flow [2024-06-28 02:21:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-06-28 02:21:43,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-06-28 02:21:43,723 INFO L175 Difference]: Start difference. First operand has 142 places, 172 transitions, 2514 flow. Second operand 6 states and 216 transitions. [2024-06-28 02:21:43,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 198 transitions, 3179 flow [2024-06-28 02:21:43,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 198 transitions, 3085 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:43,804 INFO L231 Difference]: Finished difference. Result has 149 places, 183 transitions, 2810 flow [2024-06-28 02:21:43,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2810, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2024-06-28 02:21:43,805 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 99 predicate places. [2024-06-28 02:21:43,805 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 2810 flow [2024-06-28 02:21:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:43,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:43,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:43,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:21:43,806 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:43,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1087161357, now seen corresponding path program 4 times [2024-06-28 02:21:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719723447] [2024-06-28 02:21:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:43,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:43,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719723447] [2024-06-28 02:21:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719723447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485019798] [2024-06-28 02:21:43,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:43,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:43,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 53 [2024-06-28 02:21:43,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 183 transitions, 2810 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:43,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:43,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 53 [2024-06-28 02:21:43,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:44,068 INFO L124 PetriNetUnfolderBase]: 834/1986 cut-off events. [2024-06-28 02:21:44,068 INFO L125 PetriNetUnfolderBase]: For 34700/34896 co-relation queries the response was YES. [2024-06-28 02:21:44,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10690 conditions, 1986 events. 834/1986 cut-off events. For 34700/34896 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14453 event pairs, 185 based on Foata normal form. 104/1910 useless extension candidates. Maximal degree in co-relation 9679. Up to 395 conditions per place. [2024-06-28 02:21:44,083 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 32 selfloop transitions, 49 changer transitions 0/165 dead transitions. [2024-06-28 02:21:44,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 2553 flow [2024-06-28 02:21:44,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2024-06-28 02:21:44,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7396226415094339 [2024-06-28 02:21:44,085 INFO L175 Difference]: Start difference. First operand has 149 places, 183 transitions, 2810 flow. Second operand 5 states and 196 transitions. [2024-06-28 02:21:44,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 2553 flow [2024-06-28 02:21:44,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 2281 flow, removed 17 selfloop flow, removed 11 redundant places. [2024-06-28 02:21:44,133 INFO L231 Difference]: Finished difference. Result has 144 places, 156 transitions, 2217 flow [2024-06-28 02:21:44,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2217, PETRI_PLACES=144, PETRI_TRANSITIONS=156} [2024-06-28 02:21:44,134 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 94 predicate places. [2024-06-28 02:21:44,134 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 156 transitions, 2217 flow [2024-06-28 02:21:44,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:44,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:44,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:44,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:21:44,134 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:44,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 712759704, now seen corresponding path program 2 times [2024-06-28 02:21:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213623558] [2024-06-28 02:21:44,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:44,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213623558] [2024-06-28 02:21:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213623558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:44,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083655296] [2024-06-28 02:21:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:44,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:44,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 156 transitions, 2217 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:44,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:44,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:44,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:44,478 INFO L124 PetriNetUnfolderBase]: 1004/2212 cut-off events. [2024-06-28 02:21:44,478 INFO L125 PetriNetUnfolderBase]: For 40080/40419 co-relation queries the response was YES. [2024-06-28 02:21:44,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12393 conditions, 2212 events. 1004/2212 cut-off events. For 40080/40419 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15625 event pairs, 301 based on Foata normal form. 104/2177 useless extension candidates. Maximal degree in co-relation 10858. Up to 836 conditions per place. [2024-06-28 02:21:44,497 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 76 selfloop transitions, 68 changer transitions 2/175 dead transitions. [2024-06-28 02:21:44,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 175 transitions, 2686 flow [2024-06-28 02:21:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-28 02:21:44,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635220125786163 [2024-06-28 02:21:44,499 INFO L175 Difference]: Start difference. First operand has 144 places, 156 transitions, 2217 flow. Second operand 6 states and 211 transitions. [2024-06-28 02:21:44,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 175 transitions, 2686 flow [2024-06-28 02:21:44,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 175 transitions, 2664 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 02:21:44,564 INFO L231 Difference]: Finished difference. Result has 148 places, 159 transitions, 2388 flow [2024-06-28 02:21:44,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2388, PETRI_PLACES=148, PETRI_TRANSITIONS=159} [2024-06-28 02:21:44,565 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 98 predicate places. [2024-06-28 02:21:44,565 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 159 transitions, 2388 flow [2024-06-28 02:21:44,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:44,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:44,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:44,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:21:44,566 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:44,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 713147514, now seen corresponding path program 3 times [2024-06-28 02:21:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582290111] [2024-06-28 02:21:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582290111] [2024-06-28 02:21:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582290111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287003624] [2024-06-28 02:21:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:44,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:44,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:44,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:44,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:44,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:44,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 159 transitions, 2388 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:44,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:44,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:44,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:44,935 INFO L124 PetriNetUnfolderBase]: 999/2200 cut-off events. [2024-06-28 02:21:44,936 INFO L125 PetriNetUnfolderBase]: For 44579/44880 co-relation queries the response was YES. [2024-06-28 02:21:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12749 conditions, 2200 events. 999/2200 cut-off events. For 44579/44880 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15451 event pairs, 302 based on Foata normal form. 72/2136 useless extension candidates. Maximal degree in co-relation 11135. Up to 832 conditions per place. [2024-06-28 02:21:44,957 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 74 selfloop transitions, 67 changer transitions 1/171 dead transitions. [2024-06-28 02:21:44,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 2766 flow [2024-06-28 02:21:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-06-28 02:21:44,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-06-28 02:21:44,961 INFO L175 Difference]: Start difference. First operand has 148 places, 159 transitions, 2388 flow. Second operand 6 states and 207 transitions. [2024-06-28 02:21:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 2766 flow [2024-06-28 02:21:45,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 171 transitions, 2620 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 02:21:45,027 INFO L231 Difference]: Finished difference. Result has 150 places, 159 transitions, 2382 flow [2024-06-28 02:21:45,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2382, PETRI_PLACES=150, PETRI_TRANSITIONS=159} [2024-06-28 02:21:45,028 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 100 predicate places. [2024-06-28 02:21:45,028 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 159 transitions, 2382 flow [2024-06-28 02:21:45,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:45,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:21:45,029 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:45,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -886114418, now seen corresponding path program 1 times [2024-06-28 02:21:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3481907] [2024-06-28 02:21:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3481907] [2024-06-28 02:21:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3481907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127914856] [2024-06-28 02:21:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:45,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 53 [2024-06-28 02:21:45,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 159 transitions, 2382 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:45,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 53 [2024-06-28 02:21:45,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:45,284 INFO L124 PetriNetUnfolderBase]: 629/1496 cut-off events. [2024-06-28 02:21:45,284 INFO L125 PetriNetUnfolderBase]: For 23228/23322 co-relation queries the response was YES. [2024-06-28 02:21:45,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 1496 events. 629/1496 cut-off events. For 23228/23322 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9958 event pairs, 95 based on Foata normal form. 57/1425 useless extension candidates. Maximal degree in co-relation 7368. Up to 239 conditions per place. [2024-06-28 02:21:45,298 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 37 selfloop transitions, 47 changer transitions 0/168 dead transitions. [2024-06-28 02:21:45,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 168 transitions, 2495 flow [2024-06-28 02:21:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-06-28 02:21:45,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7433962264150943 [2024-06-28 02:21:45,300 INFO L175 Difference]: Start difference. First operand has 150 places, 159 transitions, 2382 flow. Second operand 5 states and 197 transitions. [2024-06-28 02:21:45,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 168 transitions, 2495 flow [2024-06-28 02:21:45,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 168 transitions, 2357 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:45,344 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 2284 flow [2024-06-28 02:21:45,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2284, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2024-06-28 02:21:45,344 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 101 predicate places. [2024-06-28 02:21:45,345 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 2284 flow [2024-06-28 02:21:45,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:45,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:45,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:21:45,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:45,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1464304471, now seen corresponding path program 1 times [2024-06-28 02:21:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030792908] [2024-06-28 02:21:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:45,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030792908] [2024-06-28 02:21:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030792908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:45,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:45,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946260735] [2024-06-28 02:21:45,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:45,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:45,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:45,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:45,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:45,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 2284 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:45,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:45,659 INFO L124 PetriNetUnfolderBase]: 704/1576 cut-off events. [2024-06-28 02:21:45,660 INFO L125 PetriNetUnfolderBase]: For 33398/33661 co-relation queries the response was YES. [2024-06-28 02:21:45,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9306 conditions, 1576 events. 704/1576 cut-off events. For 33398/33661 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10355 event pairs, 139 based on Foata normal form. 59/1533 useless extension candidates. Maximal degree in co-relation 7755. Up to 381 conditions per place. [2024-06-28 02:21:45,674 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 118 selfloop transitions, 32 changer transitions 1/179 dead transitions. [2024-06-28 02:21:45,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 179 transitions, 2770 flow [2024-06-28 02:21:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-06-28 02:21:45,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-06-28 02:21:45,677 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 2284 flow. Second operand 6 states and 216 transitions. [2024-06-28 02:21:45,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 179 transitions, 2770 flow [2024-06-28 02:21:45,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 179 transitions, 2735 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:45,724 INFO L231 Difference]: Finished difference. Result has 157 places, 156 transitions, 2356 flow [2024-06-28 02:21:45,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2356, PETRI_PLACES=157, PETRI_TRANSITIONS=156} [2024-06-28 02:21:45,725 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 107 predicate places. [2024-06-28 02:21:45,725 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 156 transitions, 2356 flow [2024-06-28 02:21:45,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:45,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:21:45,726 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:45,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2098424233, now seen corresponding path program 2 times [2024-06-28 02:21:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893271583] [2024-06-28 02:21:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893271583] [2024-06-28 02:21:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893271583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:45,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401612054] [2024-06-28 02:21:45,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:45,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:45,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:45,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 2356 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:45,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:45,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:45,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:46,035 INFO L124 PetriNetUnfolderBase]: 713/1604 cut-off events. [2024-06-28 02:21:46,035 INFO L125 PetriNetUnfolderBase]: For 36730/36985 co-relation queries the response was YES. [2024-06-28 02:21:46,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9715 conditions, 1604 events. 713/1604 cut-off events. For 36730/36985 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10710 event pairs, 137 based on Foata normal form. 64/1559 useless extension candidates. Maximal degree in co-relation 7323. Up to 381 conditions per place. [2024-06-28 02:21:46,050 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 119 selfloop transitions, 29 changer transitions 1/177 dead transitions. [2024-06-28 02:21:46,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 177 transitions, 2814 flow [2024-06-28 02:21:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-06-28 02:21:46,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6698113207547169 [2024-06-28 02:21:46,052 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 2356 flow. Second operand 6 states and 213 transitions. [2024-06-28 02:21:46,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 177 transitions, 2814 flow [2024-06-28 02:21:46,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 177 transitions, 2739 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:46,103 INFO L231 Difference]: Finished difference. Result has 160 places, 158 transitions, 2388 flow [2024-06-28 02:21:46,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2388, PETRI_PLACES=160, PETRI_TRANSITIONS=158} [2024-06-28 02:21:46,104 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 110 predicate places. [2024-06-28 02:21:46,104 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 158 transitions, 2388 flow [2024-06-28 02:21:46,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:46,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:46,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:21:46,105 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:46,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1131908823, now seen corresponding path program 3 times [2024-06-28 02:21:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015413014] [2024-06-28 02:21:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015413014] [2024-06-28 02:21:46,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015413014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:46,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:46,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565021593] [2024-06-28 02:21:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:46,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:46,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:46,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 158 transitions, 2388 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:46,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:46,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:46,411 INFO L124 PetriNetUnfolderBase]: 701/1595 cut-off events. [2024-06-28 02:21:46,411 INFO L125 PetriNetUnfolderBase]: For 35860/36014 co-relation queries the response was YES. [2024-06-28 02:21:46,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 1595 events. 701/1595 cut-off events. For 35860/36014 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10477 event pairs, 156 based on Foata normal form. 70/1585 useless extension candidates. Maximal degree in co-relation 7813. Up to 415 conditions per place. [2024-06-28 02:21:46,424 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 95 selfloop transitions, 49 changer transitions 1/173 dead transitions. [2024-06-28 02:21:46,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 2791 flow [2024-06-28 02:21:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-06-28 02:21:46,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-06-28 02:21:46,426 INFO L175 Difference]: Start difference. First operand has 160 places, 158 transitions, 2388 flow. Second operand 6 states and 210 transitions. [2024-06-28 02:21:46,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 2791 flow [2024-06-28 02:21:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 173 transitions, 2728 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 02:21:46,517 INFO L231 Difference]: Finished difference. Result has 162 places, 158 transitions, 2431 flow [2024-06-28 02:21:46,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2431, PETRI_PLACES=162, PETRI_TRANSITIONS=158} [2024-06-28 02:21:46,520 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 112 predicate places. [2024-06-28 02:21:46,520 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 158 transitions, 2431 flow [2024-06-28 02:21:46,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:46,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:46,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:21:46,521 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:46,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2146131683, now seen corresponding path program 1 times [2024-06-28 02:21:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:46,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49426646] [2024-06-28 02:21:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49426646] [2024-06-28 02:21:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49426646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226807992] [2024-06-28 02:21:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:46,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:46,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:46,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:46,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 158 transitions, 2431 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:46,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:46,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:46,811 INFO L124 PetriNetUnfolderBase]: 705/1617 cut-off events. [2024-06-28 02:21:46,811 INFO L125 PetriNetUnfolderBase]: For 39145/39297 co-relation queries the response was YES. [2024-06-28 02:21:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9711 conditions, 1617 events. 705/1617 cut-off events. For 39145/39297 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10817 event pairs, 210 based on Foata normal form. 53/1575 useless extension candidates. Maximal degree in co-relation 9095. Up to 604 conditions per place. [2024-06-28 02:21:46,823 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 93 selfloop transitions, 50 changer transitions 0/171 dead transitions. [2024-06-28 02:21:46,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 171 transitions, 2816 flow [2024-06-28 02:21:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2024-06-28 02:21:46,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-06-28 02:21:46,825 INFO L175 Difference]: Start difference. First operand has 162 places, 158 transitions, 2431 flow. Second operand 6 states and 204 transitions. [2024-06-28 02:21:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 171 transitions, 2816 flow [2024-06-28 02:21:46,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 171 transitions, 2695 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:46,872 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 2451 flow [2024-06-28 02:21:46,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2451, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2024-06-28 02:21:46,873 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 113 predicate places. [2024-06-28 02:21:46,873 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 2451 flow [2024-06-28 02:21:46,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:46,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:46,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:21:46,874 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:46,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2044190419, now seen corresponding path program 2 times [2024-06-28 02:21:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797867677] [2024-06-28 02:21:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797867677] [2024-06-28 02:21:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797867677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662322323] [2024-06-28 02:21:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:46,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:46,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:46,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 2451 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:46,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:46,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:47,165 INFO L124 PetriNetUnfolderBase]: 723/1660 cut-off events. [2024-06-28 02:21:47,165 INFO L125 PetriNetUnfolderBase]: For 39197/39435 co-relation queries the response was YES. [2024-06-28 02:21:47,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 1660 events. 723/1660 cut-off events. For 39197/39435 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11187 event pairs, 208 based on Foata normal form. 59/1611 useless extension candidates. Maximal degree in co-relation 8360. Up to 710 conditions per place. [2024-06-28 02:21:47,178 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 114 selfloop transitions, 33 changer transitions 3/178 dead transitions. [2024-06-28 02:21:47,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 2922 flow [2024-06-28 02:21:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-06-28 02:21:47,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.660377358490566 [2024-06-28 02:21:47,180 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 2451 flow. Second operand 6 states and 210 transitions. [2024-06-28 02:21:47,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 2922 flow [2024-06-28 02:21:47,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 178 transitions, 2862 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:47,238 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 2463 flow [2024-06-28 02:21:47,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2463, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-06-28 02:21:47,239 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 116 predicate places. [2024-06-28 02:21:47,239 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 2463 flow [2024-06-28 02:21:47,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:47,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:47,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:21:47,239 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:47,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 41999131, now seen corresponding path program 3 times [2024-06-28 02:21:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178549097] [2024-06-28 02:21:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178549097] [2024-06-28 02:21:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178549097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:47,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833924780] [2024-06-28 02:21:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:47,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:47,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 2463 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:47,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:47,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:47,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:47,532 INFO L124 PetriNetUnfolderBase]: 736/1695 cut-off events. [2024-06-28 02:21:47,533 INFO L125 PetriNetUnfolderBase]: For 41932/42182 co-relation queries the response was YES. [2024-06-28 02:21:47,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10139 conditions, 1695 events. 736/1695 cut-off events. For 41932/42182 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11482 event pairs, 210 based on Foata normal form. 48/1631 useless extension candidates. Maximal degree in co-relation 8194. Up to 716 conditions per place. [2024-06-28 02:21:47,548 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 115 selfloop transitions, 30 changer transitions 1/174 dead transitions. [2024-06-28 02:21:47,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 174 transitions, 2908 flow [2024-06-28 02:21:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-06-28 02:21:47,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446540880503144 [2024-06-28 02:21:47,550 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 2463 flow. Second operand 6 states and 205 transitions. [2024-06-28 02:21:47,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 174 transitions, 2908 flow [2024-06-28 02:21:47,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 174 transitions, 2825 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:47,606 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 2482 flow [2024-06-28 02:21:47,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2384, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2482, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2024-06-28 02:21:47,611 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 117 predicate places. [2024-06-28 02:21:47,611 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 2482 flow [2024-06-28 02:21:47,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:47,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:47,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:47,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:21:47,612 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:47,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 685555723, now seen corresponding path program 4 times [2024-06-28 02:21:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86499965] [2024-06-28 02:21:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86499965] [2024-06-28 02:21:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86499965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:47,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:47,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877313196] [2024-06-28 02:21:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:47,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:47,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:47,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 2482 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:47,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:47,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:47,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:47,916 INFO L124 PetriNetUnfolderBase]: 729/1684 cut-off events. [2024-06-28 02:21:47,916 INFO L125 PetriNetUnfolderBase]: For 41769/42024 co-relation queries the response was YES. [2024-06-28 02:21:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9949 conditions, 1684 events. 729/1684 cut-off events. For 41769/42024 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11410 event pairs, 205 based on Foata normal form. 62/1633 useless extension candidates. Maximal degree in co-relation 8180. Up to 714 conditions per place. [2024-06-28 02:21:47,930 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 117 selfloop transitions, 30 changer transitions 2/177 dead transitions. [2024-06-28 02:21:47,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 2908 flow [2024-06-28 02:21:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-28 02:21:47,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6540880503144654 [2024-06-28 02:21:47,931 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 2482 flow. Second operand 6 states and 208 transitions. [2024-06-28 02:21:47,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 177 transitions, 2908 flow [2024-06-28 02:21:47,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 177 transitions, 2836 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:47,997 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 2476 flow [2024-06-28 02:21:47,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2476, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2024-06-28 02:21:47,998 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 120 predicate places. [2024-06-28 02:21:47,998 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 2476 flow [2024-06-28 02:21:47,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:47,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:47,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:47,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:21:47,999 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:47,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1914989137, now seen corresponding path program 1 times [2024-06-28 02:21:47,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664185347] [2024-06-28 02:21:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:48,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664185347] [2024-06-28 02:21:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664185347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777137881] [2024-06-28 02:21:48,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:48,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:21:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:21:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:21:48,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:48,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 2476 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:48,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:48,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:48,290 INFO L124 PetriNetUnfolderBase]: 692/1602 cut-off events. [2024-06-28 02:21:48,291 INFO L125 PetriNetUnfolderBase]: For 39995/40144 co-relation queries the response was YES. [2024-06-28 02:21:48,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 1602 events. 692/1602 cut-off events. For 39995/40144 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10390 event pairs, 116 based on Foata normal form. 56/1573 useless extension candidates. Maximal degree in co-relation 9097. Up to 751 conditions per place. [2024-06-28 02:21:48,304 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 111 selfloop transitions, 38 changer transitions 0/177 dead transitions. [2024-06-28 02:21:48,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 177 transitions, 2908 flow [2024-06-28 02:21:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2024-06-28 02:21:48,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7056603773584905 [2024-06-28 02:21:48,305 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 2476 flow. Second operand 5 states and 187 transitions. [2024-06-28 02:21:48,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 177 transitions, 2908 flow [2024-06-28 02:21:48,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 177 transitions, 2803 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:48,364 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 2464 flow [2024-06-28 02:21:48,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2464, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2024-06-28 02:21:48,365 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 120 predicate places. [2024-06-28 02:21:48,365 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 2464 flow [2024-06-28 02:21:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:48,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:21:48,366 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:48,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -805709034, now seen corresponding path program 1 times [2024-06-28 02:21:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751754671] [2024-06-28 02:21:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751754671] [2024-06-28 02:21:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751754671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:21:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645351749] [2024-06-28 02:21:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:48,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:48,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2024-06-28 02:21:48,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 2464 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:48,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2024-06-28 02:21:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:48,530 INFO L124 PetriNetUnfolderBase]: 420/1026 cut-off events. [2024-06-28 02:21:48,531 INFO L125 PetriNetUnfolderBase]: For 13159/13181 co-relation queries the response was YES. [2024-06-28 02:21:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 1026 events. 420/1026 cut-off events. For 13159/13181 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6615 event pairs, 75 based on Foata normal form. 13/950 useless extension candidates. Maximal degree in co-relation 3912. Up to 406 conditions per place. [2024-06-28 02:21:48,538 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 42 selfloop transitions, 16 changer transitions 0/142 dead transitions. [2024-06-28 02:21:48,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 142 transitions, 1931 flow [2024-06-28 02:21:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-06-28 02:21:48,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7094339622641509 [2024-06-28 02:21:48,540 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 2464 flow. Second operand 5 states and 188 transitions. [2024-06-28 02:21:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 142 transitions, 1931 flow [2024-06-28 02:21:48,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 142 transitions, 1620 flow, removed 4 selfloop flow, removed 19 redundant places. [2024-06-28 02:21:48,572 INFO L231 Difference]: Finished difference. Result has 159 places, 131 transitions, 1544 flow [2024-06-28 02:21:48,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1544, PETRI_PLACES=159, PETRI_TRANSITIONS=131} [2024-06-28 02:21:48,572 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 109 predicate places. [2024-06-28 02:21:48,572 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 131 transitions, 1544 flow [2024-06-28 02:21:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:48,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:48,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:21:48,573 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:48,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1249035131, now seen corresponding path program 1 times [2024-06-28 02:21:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642701115] [2024-06-28 02:21:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642701115] [2024-06-28 02:21:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642701115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750414800] [2024-06-28 02:21:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:48,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:48,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:48,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:48,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 131 transitions, 1544 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:48,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:48,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:48,807 INFO L124 PetriNetUnfolderBase]: 435/1048 cut-off events. [2024-06-28 02:21:48,808 INFO L125 PetriNetUnfolderBase]: For 16849/16999 co-relation queries the response was YES. [2024-06-28 02:21:48,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1048 events. 435/1048 cut-off events. For 16849/16999 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6609 event pairs, 85 based on Foata normal form. 40/1024 useless extension candidates. Maximal degree in co-relation 4127. Up to 296 conditions per place. [2024-06-28 02:21:48,815 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 77 selfloop transitions, 32 changer transitions 9/149 dead transitions. [2024-06-28 02:21:48,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 149 transitions, 1874 flow [2024-06-28 02:21:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-06-28 02:21:48,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2024-06-28 02:21:48,816 INFO L175 Difference]: Start difference. First operand has 159 places, 131 transitions, 1544 flow. Second operand 6 states and 214 transitions. [2024-06-28 02:21:48,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 149 transitions, 1874 flow [2024-06-28 02:21:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 149 transitions, 1874 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:21:48,852 INFO L231 Difference]: Finished difference. Result has 165 places, 129 transitions, 1582 flow [2024-06-28 02:21:48,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1582, PETRI_PLACES=165, PETRI_TRANSITIONS=129} [2024-06-28 02:21:48,854 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 115 predicate places. [2024-06-28 02:21:48,854 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 129 transitions, 1582 flow [2024-06-28 02:21:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:48,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:21:48,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:48,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash 390931529, now seen corresponding path program 2 times [2024-06-28 02:21:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293263969] [2024-06-28 02:21:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293263969] [2024-06-28 02:21:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293263969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:48,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:48,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212527485] [2024-06-28 02:21:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:48,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:48,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 129 transitions, 1582 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:48,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:48,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:48,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:49,090 INFO L124 PetriNetUnfolderBase]: 432/1051 cut-off events. [2024-06-28 02:21:49,090 INFO L125 PetriNetUnfolderBase]: For 19079/19229 co-relation queries the response was YES. [2024-06-28 02:21:49,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5353 conditions, 1051 events. 432/1051 cut-off events. For 19079/19229 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6593 event pairs, 84 based on Foata normal form. 38/1028 useless extension candidates. Maximal degree in co-relation 4259. Up to 480 conditions per place. [2024-06-28 02:21:49,096 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 89 selfloop transitions, 21 changer transitions 4/145 dead transitions. [2024-06-28 02:21:49,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 145 transitions, 1870 flow [2024-06-28 02:21:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-28 02:21:49,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 02:21:49,098 INFO L175 Difference]: Start difference. First operand has 165 places, 129 transitions, 1582 flow. Second operand 6 states and 212 transitions. [2024-06-28 02:21:49,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 145 transitions, 1870 flow [2024-06-28 02:21:49,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 145 transitions, 1797 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:49,133 INFO L231 Difference]: Finished difference. Result has 166 places, 129 transitions, 1564 flow [2024-06-28 02:21:49,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=166, PETRI_TRANSITIONS=129} [2024-06-28 02:21:49,134 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 116 predicate places. [2024-06-28 02:21:49,134 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 129 transitions, 1564 flow [2024-06-28 02:21:49,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:49,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:49,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:21:49,135 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:49,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1137635289, now seen corresponding path program 3 times [2024-06-28 02:21:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461970000] [2024-06-28 02:21:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:49,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461970000] [2024-06-28 02:21:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461970000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054592092] [2024-06-28 02:21:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:49,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:49,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:49,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:49,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 129 transitions, 1564 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:49,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:49,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:49,400 INFO L124 PetriNetUnfolderBase]: 410/1020 cut-off events. [2024-06-28 02:21:49,401 INFO L125 PetriNetUnfolderBase]: For 17545/17627 co-relation queries the response was YES. [2024-06-28 02:21:49,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 1020 events. 410/1020 cut-off events. For 17545/17627 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6490 event pairs, 146 based on Foata normal form. 51/1020 useless extension candidates. Maximal degree in co-relation 3979. Up to 449 conditions per place. [2024-06-28 02:21:49,408 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 53 selfloop transitions, 51 changer transitions 9/144 dead transitions. [2024-06-28 02:21:49,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 144 transitions, 1891 flow [2024-06-28 02:21:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-06-28 02:21:49,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6572327044025157 [2024-06-28 02:21:49,409 INFO L175 Difference]: Start difference. First operand has 166 places, 129 transitions, 1564 flow. Second operand 6 states and 209 transitions. [2024-06-28 02:21:49,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 144 transitions, 1891 flow [2024-06-28 02:21:49,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 144 transitions, 1849 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-28 02:21:49,448 INFO L231 Difference]: Finished difference. Result has 168 places, 125 transitions, 1575 flow [2024-06-28 02:21:49,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1575, PETRI_PLACES=168, PETRI_TRANSITIONS=125} [2024-06-28 02:21:49,449 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 118 predicate places. [2024-06-28 02:21:49,449 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 125 transitions, 1575 flow [2024-06-28 02:21:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:49,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:21:49,449 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:49,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1714703733, now seen corresponding path program 1 times [2024-06-28 02:21:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:49,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685295249] [2024-06-28 02:21:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685295249] [2024-06-28 02:21:49,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685295249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:49,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:49,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618021921] [2024-06-28 02:21:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:49,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:49,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:49,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 125 transitions, 1575 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:49,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:49,665 INFO L124 PetriNetUnfolderBase]: 408/1008 cut-off events. [2024-06-28 02:21:49,666 INFO L125 PetriNetUnfolderBase]: For 19324/19411 co-relation queries the response was YES. [2024-06-28 02:21:49,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5211 conditions, 1008 events. 408/1008 cut-off events. For 19324/19411 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6289 event pairs, 103 based on Foata normal form. 54/1018 useless extension candidates. Maximal degree in co-relation 5024. Up to 324 conditions per place. [2024-06-28 02:21:49,671 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 71 selfloop transitions, 39 changer transitions 8/149 dead transitions. [2024-06-28 02:21:49,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 2097 flow [2024-06-28 02:21:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-06-28 02:21:49,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2024-06-28 02:21:49,689 INFO L175 Difference]: Start difference. First operand has 168 places, 125 transitions, 1575 flow. Second operand 6 states and 218 transitions. [2024-06-28 02:21:49,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 149 transitions, 2097 flow [2024-06-28 02:21:49,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 149 transitions, 1956 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:49,738 INFO L231 Difference]: Finished difference. Result has 169 places, 123 transitions, 1512 flow [2024-06-28 02:21:49,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=169, PETRI_TRANSITIONS=123} [2024-06-28 02:21:49,739 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 119 predicate places. [2024-06-28 02:21:49,739 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 123 transitions, 1512 flow [2024-06-28 02:21:49,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:49,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:49,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:21:49,739 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:49,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1666901813, now seen corresponding path program 2 times [2024-06-28 02:21:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123088171] [2024-06-28 02:21:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123088171] [2024-06-28 02:21:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123088171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:49,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611214014] [2024-06-28 02:21:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:49,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:49,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:49,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 123 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:49,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:49,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:49,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:50,028 INFO L124 PetriNetUnfolderBase]: 408/1005 cut-off events. [2024-06-28 02:21:50,029 INFO L125 PetriNetUnfolderBase]: For 19201/19350 co-relation queries the response was YES. [2024-06-28 02:21:50,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 1005 events. 408/1005 cut-off events. For 19201/19350 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6324 event pairs, 83 based on Foata normal form. 40/980 useless extension candidates. Maximal degree in co-relation 4090. Up to 261 conditions per place. [2024-06-28 02:21:50,037 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 77 selfloop transitions, 27 changer transitions 4/139 dead transitions. [2024-06-28 02:21:50,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 139 transitions, 1837 flow [2024-06-28 02:21:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-28 02:21:50,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 02:21:50,039 INFO L175 Difference]: Start difference. First operand has 169 places, 123 transitions, 1512 flow. Second operand 6 states and 212 transitions. [2024-06-28 02:21:50,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 139 transitions, 1837 flow [2024-06-28 02:21:50,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 139 transitions, 1788 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:50,076 INFO L231 Difference]: Finished difference. Result has 172 places, 122 transitions, 1524 flow [2024-06-28 02:21:50,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1524, PETRI_PLACES=172, PETRI_TRANSITIONS=122} [2024-06-28 02:21:50,077 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 122 predicate places. [2024-06-28 02:21:50,077 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 122 transitions, 1524 flow [2024-06-28 02:21:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:50,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:50,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:21:50,078 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:50,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1380014483, now seen corresponding path program 3 times [2024-06-28 02:21:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362615917] [2024-06-28 02:21:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362615917] [2024-06-28 02:21:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362615917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998258080] [2024-06-28 02:21:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:50,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:50,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 122 transitions, 1524 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:50,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:50,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:50,305 INFO L124 PetriNetUnfolderBase]: 391/982 cut-off events. [2024-06-28 02:21:50,306 INFO L125 PetriNetUnfolderBase]: For 19320/19477 co-relation queries the response was YES. [2024-06-28 02:21:50,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5083 conditions, 982 events. 391/982 cut-off events. For 19320/19477 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6142 event pairs, 86 based on Foata normal form. 34/953 useless extension candidates. Maximal degree in co-relation 3976. Up to 456 conditions per place. [2024-06-28 02:21:50,312 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 81 selfloop transitions, 19 changer transitions 2/133 dead transitions. [2024-06-28 02:21:50,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 133 transitions, 1752 flow [2024-06-28 02:21:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-06-28 02:21:50,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-06-28 02:21:50,313 INFO L175 Difference]: Start difference. First operand has 172 places, 122 transitions, 1524 flow. Second operand 6 states and 207 transitions. [2024-06-28 02:21:50,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 133 transitions, 1752 flow [2024-06-28 02:21:50,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 133 transitions, 1716 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 02:21:50,351 INFO L231 Difference]: Finished difference. Result has 175 places, 121 transitions, 1515 flow [2024-06-28 02:21:50,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1515, PETRI_PLACES=175, PETRI_TRANSITIONS=121} [2024-06-28 02:21:50,352 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 125 predicate places. [2024-06-28 02:21:50,352 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 121 transitions, 1515 flow [2024-06-28 02:21:50,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:50,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:50,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:21:50,353 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:50,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1631141726, now seen corresponding path program 1 times [2024-06-28 02:21:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:50,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60299520] [2024-06-28 02:21:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60299520] [2024-06-28 02:21:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60299520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:21:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113012996] [2024-06-28 02:21:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:50,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:21:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:21:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:21:50,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2024-06-28 02:21:50,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 121 transitions, 1515 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:50,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2024-06-28 02:21:50,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:50,521 INFO L124 PetriNetUnfolderBase]: 461/1114 cut-off events. [2024-06-28 02:21:50,522 INFO L125 PetriNetUnfolderBase]: For 14662/14681 co-relation queries the response was YES. [2024-06-28 02:21:50,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5166 conditions, 1114 events. 461/1114 cut-off events. For 14662/14681 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7101 event pairs, 98 based on Foata normal form. 10/1040 useless extension candidates. Maximal degree in co-relation 4246. Up to 338 conditions per place. [2024-06-28 02:21:50,529 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 37 selfloop transitions, 21 changer transitions 8/143 dead transitions. [2024-06-28 02:21:50,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 143 transitions, 1735 flow [2024-06-28 02:21:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:21:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:21:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2024-06-28 02:21:50,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283018867924528 [2024-06-28 02:21:50,531 INFO L175 Difference]: Start difference. First operand has 175 places, 121 transitions, 1515 flow. Second operand 5 states and 193 transitions. [2024-06-28 02:21:50,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 143 transitions, 1735 flow [2024-06-28 02:21:50,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 143 transitions, 1676 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:50,569 INFO L231 Difference]: Finished difference. Result has 176 places, 127 transitions, 1520 flow [2024-06-28 02:21:50,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1520, PETRI_PLACES=176, PETRI_TRANSITIONS=127} [2024-06-28 02:21:50,570 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 126 predicate places. [2024-06-28 02:21:50,570 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 127 transitions, 1520 flow [2024-06-28 02:21:50,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:50,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:50,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:21:50,571 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:50,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash -98409308, now seen corresponding path program 2 times [2024-06-28 02:21:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:50,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128706764] [2024-06-28 02:21:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128706764] [2024-06-28 02:21:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128706764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:50,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435782598] [2024-06-28 02:21:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:50,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:50,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 127 transitions, 1520 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:50,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:50,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:50,783 INFO L124 PetriNetUnfolderBase]: 389/992 cut-off events. [2024-06-28 02:21:50,783 INFO L125 PetriNetUnfolderBase]: For 18262/18353 co-relation queries the response was YES. [2024-06-28 02:21:50,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5153 conditions, 992 events. 389/992 cut-off events. For 18262/18353 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6176 event pairs, 91 based on Foata normal form. 35/999 useless extension candidates. Maximal degree in co-relation 5005. Up to 339 conditions per place. [2024-06-28 02:21:50,790 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 70 selfloop transitions, 37 changer transitions 1/145 dead transitions. [2024-06-28 02:21:50,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 145 transitions, 1846 flow [2024-06-28 02:21:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-28 02:21:50,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635220125786163 [2024-06-28 02:21:50,792 INFO L175 Difference]: Start difference. First operand has 176 places, 127 transitions, 1520 flow. Second operand 6 states and 211 transitions. [2024-06-28 02:21:50,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 145 transitions, 1846 flow [2024-06-28 02:21:50,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 145 transitions, 1842 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 02:21:50,829 INFO L231 Difference]: Finished difference. Result has 180 places, 126 transitions, 1570 flow [2024-06-28 02:21:50,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1570, PETRI_PLACES=180, PETRI_TRANSITIONS=126} [2024-06-28 02:21:50,829 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 130 predicate places. [2024-06-28 02:21:50,829 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 126 transitions, 1570 flow [2024-06-28 02:21:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:50,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:50,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:21:50,830 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:50,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1889443240, now seen corresponding path program 3 times [2024-06-28 02:21:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116434826] [2024-06-28 02:21:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116434826] [2024-06-28 02:21:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116434826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:50,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800920884] [2024-06-28 02:21:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:50,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:50,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:50,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:50,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 126 transitions, 1570 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:50,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:50,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:50,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:51,041 INFO L124 PetriNetUnfolderBase]: 381/981 cut-off events. [2024-06-28 02:21:51,041 INFO L125 PetriNetUnfolderBase]: For 18306/18395 co-relation queries the response was YES. [2024-06-28 02:21:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 981 events. 381/981 cut-off events. For 18306/18395 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6134 event pairs, 93 based on Foata normal form. 29/982 useless extension candidates. Maximal degree in co-relation 4998. Up to 336 conditions per place. [2024-06-28 02:21:51,048 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 75 selfloop transitions, 33 changer transitions 1/146 dead transitions. [2024-06-28 02:21:51,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 146 transitions, 1912 flow [2024-06-28 02:21:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-28 02:21:51,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6635220125786163 [2024-06-28 02:21:51,049 INFO L175 Difference]: Start difference. First operand has 180 places, 126 transitions, 1570 flow. Second operand 6 states and 211 transitions. [2024-06-28 02:21:51,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 146 transitions, 1912 flow [2024-06-28 02:21:51,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 146 transitions, 1826 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:51,091 INFO L231 Difference]: Finished difference. Result has 181 places, 125 transitions, 1533 flow [2024-06-28 02:21:51,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1533, PETRI_PLACES=181, PETRI_TRANSITIONS=125} [2024-06-28 02:21:51,092 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 131 predicate places. [2024-06-28 02:21:51,092 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 125 transitions, 1533 flow [2024-06-28 02:21:51,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:51,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:51,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:21:51,093 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:51,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1241181228, now seen corresponding path program 4 times [2024-06-28 02:21:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534151799] [2024-06-28 02:21:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534151799] [2024-06-28 02:21:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534151799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:51,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:51,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123580849] [2024-06-28 02:21:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:51,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:51,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:51,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:51,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 125 transitions, 1533 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:51,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:51,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:51,301 INFO L124 PetriNetUnfolderBase]: 366/948 cut-off events. [2024-06-28 02:21:51,301 INFO L125 PetriNetUnfolderBase]: For 17040/17123 co-relation queries the response was YES. [2024-06-28 02:21:51,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 948 events. 366/948 cut-off events. For 17040/17123 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5842 event pairs, 88 based on Foata normal form. 33/957 useless extension candidates. Maximal degree in co-relation 4702. Up to 312 conditions per place. [2024-06-28 02:21:51,308 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 53 selfloop transitions, 39 changer transitions 12/141 dead transitions. [2024-06-28 02:21:51,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 141 transitions, 1789 flow [2024-06-28 02:21:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-28 02:21:51,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6540880503144654 [2024-06-28 02:21:51,309 INFO L175 Difference]: Start difference. First operand has 181 places, 125 transitions, 1533 flow. Second operand 6 states and 208 transitions. [2024-06-28 02:21:51,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 141 transitions, 1789 flow [2024-06-28 02:21:51,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 141 transitions, 1640 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 02:21:51,346 INFO L231 Difference]: Finished difference. Result has 179 places, 116 transitions, 1338 flow [2024-06-28 02:21:51,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1338, PETRI_PLACES=179, PETRI_TRANSITIONS=116} [2024-06-28 02:21:51,347 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 129 predicate places. [2024-06-28 02:21:51,347 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 116 transitions, 1338 flow [2024-06-28 02:21:51,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:51,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:51,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:21:51,348 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:51,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1619658870, now seen corresponding path program 1 times [2024-06-28 02:21:51,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:51,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252790929] [2024-06-28 02:21:51,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:51,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252790929] [2024-06-28 02:21:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252790929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:51,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558031087] [2024-06-28 02:21:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:51,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:51,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 116 transitions, 1338 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:51,562 INFO L124 PetriNetUnfolderBase]: 304/821 cut-off events. [2024-06-28 02:21:51,563 INFO L125 PetriNetUnfolderBase]: For 14877/14938 co-relation queries the response was YES. [2024-06-28 02:21:51,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4064 conditions, 821 events. 304/821 cut-off events. For 14877/14938 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5034 event pairs, 112 based on Foata normal form. 26/815 useless extension candidates. Maximal degree in co-relation 3259. Up to 351 conditions per place. [2024-06-28 02:21:51,568 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 39 changer transitions 3/124 dead transitions. [2024-06-28 02:21:51,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 124 transitions, 1532 flow [2024-06-28 02:21:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-06-28 02:21:51,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194968553459119 [2024-06-28 02:21:51,569 INFO L175 Difference]: Start difference. First operand has 179 places, 116 transitions, 1338 flow. Second operand 6 states and 197 transitions. [2024-06-28 02:21:51,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 124 transitions, 1532 flow [2024-06-28 02:21:51,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 124 transitions, 1374 flow, removed 9 selfloop flow, removed 19 redundant places. [2024-06-28 02:21:51,597 INFO L231 Difference]: Finished difference. Result has 163 places, 113 transitions, 1235 flow [2024-06-28 02:21:51,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1235, PETRI_PLACES=163, PETRI_TRANSITIONS=113} [2024-06-28 02:21:51,598 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 113 predicate places. [2024-06-28 02:21:51,598 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 113 transitions, 1235 flow [2024-06-28 02:21:51,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:51,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:51,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:21:51,599 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:51,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1228195020, now seen corresponding path program 1 times [2024-06-28 02:21:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742629413] [2024-06-28 02:21:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742629413] [2024-06-28 02:21:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742629413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:51,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:51,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907230464] [2024-06-28 02:21:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:51,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:51,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 113 transitions, 1235 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:51,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:51,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:51,938 INFO L124 PetriNetUnfolderBase]: 309/810 cut-off events. [2024-06-28 02:21:51,938 INFO L125 PetriNetUnfolderBase]: For 13762/13859 co-relation queries the response was YES. [2024-06-28 02:21:51,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 810 events. 309/810 cut-off events. For 13762/13859 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4855 event pairs, 50 based on Foata normal form. 22/796 useless extension candidates. Maximal degree in co-relation 3200. Up to 183 conditions per place. [2024-06-28 02:21:51,944 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 69 selfloop transitions, 16 changer transitions 5/127 dead transitions. [2024-06-28 02:21:51,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 127 transitions, 1524 flow [2024-06-28 02:21:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-06-28 02:21:51,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2024-06-28 02:21:51,946 INFO L175 Difference]: Start difference. First operand has 163 places, 113 transitions, 1235 flow. Second operand 6 states and 200 transitions. [2024-06-28 02:21:51,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 127 transitions, 1524 flow [2024-06-28 02:21:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 127 transitions, 1413 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 02:21:51,973 INFO L231 Difference]: Finished difference. Result has 160 places, 112 transitions, 1150 flow [2024-06-28 02:21:51,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1150, PETRI_PLACES=160, PETRI_TRANSITIONS=112} [2024-06-28 02:21:51,973 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 110 predicate places. [2024-06-28 02:21:51,973 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 112 transitions, 1150 flow [2024-06-28 02:21:51,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:51,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:51,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:21:51,974 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1803933840, now seen corresponding path program 2 times [2024-06-28 02:21:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654125177] [2024-06-28 02:21:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:52,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654125177] [2024-06-28 02:21:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654125177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:52,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570647138] [2024-06-28 02:21:52,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:52,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:52,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:52,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:52,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:52,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 112 transitions, 1150 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:52,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:52,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:52,199 INFO L124 PetriNetUnfolderBase]: 291/774 cut-off events. [2024-06-28 02:21:52,199 INFO L125 PetriNetUnfolderBase]: For 11011/11101 co-relation queries the response was YES. [2024-06-28 02:21:52,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 774 events. 291/774 cut-off events. For 11011/11101 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4600 event pairs, 46 based on Foata normal form. 18/754 useless extension candidates. Maximal degree in co-relation 2920. Up to 183 conditions per place. [2024-06-28 02:21:52,206 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 64 selfloop transitions, 8 changer transitions 17/123 dead transitions. [2024-06-28 02:21:52,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 123 transitions, 1406 flow [2024-06-28 02:21:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-06-28 02:21:52,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6257861635220126 [2024-06-28 02:21:52,207 INFO L175 Difference]: Start difference. First operand has 160 places, 112 transitions, 1150 flow. Second operand 6 states and 199 transitions. [2024-06-28 02:21:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 123 transitions, 1406 flow [2024-06-28 02:21:52,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 123 transitions, 1368 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 02:21:52,236 INFO L231 Difference]: Finished difference. Result has 160 places, 100 transitions, 984 flow [2024-06-28 02:21:52,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=984, PETRI_PLACES=160, PETRI_TRANSITIONS=100} [2024-06-28 02:21:52,237 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 110 predicate places. [2024-06-28 02:21:52,237 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 100 transitions, 984 flow [2024-06-28 02:21:52,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:52,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 02:21:52,238 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:52,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1761467250, now seen corresponding path program 3 times [2024-06-28 02:21:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520864218] [2024-06-28 02:21:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520864218] [2024-06-28 02:21:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520864218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625316021] [2024-06-28 02:21:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:52,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:52,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:52,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:52,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:52,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 100 transitions, 984 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:52,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:52,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:52,483 INFO L124 PetriNetUnfolderBase]: 233/647 cut-off events. [2024-06-28 02:21:52,483 INFO L125 PetriNetUnfolderBase]: For 8058/8103 co-relation queries the response was YES. [2024-06-28 02:21:52,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 647 events. 233/647 cut-off events. For 8058/8103 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3647 event pairs, 33 based on Foata normal form. 14/639 useless extension candidates. Maximal degree in co-relation 2453. Up to 171 conditions per place. [2024-06-28 02:21:52,487 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 34 selfloop transitions, 5 changer transitions 51/109 dead transitions. [2024-06-28 02:21:52,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 109 transitions, 1158 flow [2024-06-28 02:21:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-06-28 02:21:52,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2024-06-28 02:21:52,488 INFO L175 Difference]: Start difference. First operand has 160 places, 100 transitions, 984 flow. Second operand 6 states and 196 transitions. [2024-06-28 02:21:52,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 109 transitions, 1158 flow [2024-06-28 02:21:52,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 109 transitions, 1090 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-06-28 02:21:52,503 INFO L231 Difference]: Finished difference. Result has 147 places, 55 transitions, 463 flow [2024-06-28 02:21:52,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=147, PETRI_TRANSITIONS=55} [2024-06-28 02:21:52,503 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 97 predicate places. [2024-06-28 02:21:52,503 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 55 transitions, 463 flow [2024-06-28 02:21:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:52,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 02:21:52,504 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:52,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2058214495, now seen corresponding path program 1 times [2024-06-28 02:21:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676334162] [2024-06-28 02:21:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676334162] [2024-06-28 02:21:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676334162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:52,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:52,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947643983] [2024-06-28 02:21:52,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:52,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:52,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:52,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:52,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:52,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:52,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 55 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:52,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:52,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:52,743 INFO L124 PetriNetUnfolderBase]: 119/323 cut-off events. [2024-06-28 02:21:52,743 INFO L125 PetriNetUnfolderBase]: For 3720/3751 co-relation queries the response was YES. [2024-06-28 02:21:52,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 323 events. 119/323 cut-off events. For 3720/3751 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1439 event pairs, 15 based on Foata normal form. 21/331 useless extension candidates. Maximal degree in co-relation 1305. Up to 91 conditions per place. [2024-06-28 02:21:52,745 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 26 selfloop transitions, 12 changer transitions 7/64 dead transitions. [2024-06-28 02:21:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 64 transitions, 587 flow [2024-06-28 02:21:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-28 02:21:52,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5974842767295597 [2024-06-28 02:21:52,747 INFO L175 Difference]: Start difference. First operand has 147 places, 55 transitions, 463 flow. Second operand 6 states and 190 transitions. [2024-06-28 02:21:52,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 64 transitions, 587 flow [2024-06-28 02:21:52,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 64 transitions, 438 flow, removed 12 selfloop flow, removed 35 redundant places. [2024-06-28 02:21:52,752 INFO L231 Difference]: Finished difference. Result has 92 places, 52 transitions, 331 flow [2024-06-28 02:21:52,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=92, PETRI_TRANSITIONS=52} [2024-06-28 02:21:52,759 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2024-06-28 02:21:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 52 transitions, 331 flow [2024-06-28 02:21:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:21:52,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:52,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 02:21:52,760 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 02:21:52,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:21:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 772887449, now seen corresponding path program 2 times [2024-06-28 02:21:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:21:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698374201] [2024-06-28 02:21:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:21:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:21:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:21:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:21:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:21:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698374201] [2024-06-28 02:21:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698374201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:21:52,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:21:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:21:52,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442350988] [2024-06-28 02:21:52,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:21:52,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:21:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:21:52,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:21:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:21:52,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-06-28 02:21:52,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 52 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:21:52,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-06-28 02:21:52,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:21:52,912 INFO L124 PetriNetUnfolderBase]: 86/256 cut-off events. [2024-06-28 02:21:52,913 INFO L125 PetriNetUnfolderBase]: For 1063/1090 co-relation queries the response was YES. [2024-06-28 02:21:52,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 256 events. 86/256 cut-off events. For 1063/1090 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1136 event pairs, 10 based on Foata normal form. 9/258 useless extension candidates. Maximal degree in co-relation 811. Up to 80 conditions per place. [2024-06-28 02:21:52,914 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2024-06-28 02:21:52,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 58 transitions, 389 flow [2024-06-28 02:21:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:21:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:21:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-06-28 02:21:52,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5880503144654088 [2024-06-28 02:21:52,915 INFO L175 Difference]: Start difference. First operand has 92 places, 52 transitions, 331 flow. Second operand 6 states and 187 transitions. [2024-06-28 02:21:52,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 58 transitions, 389 flow [2024-06-28 02:21:52,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 58 transitions, 320 flow, removed 1 selfloop flow, removed 22 redundant places. [2024-06-28 02:21:52,917 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2024-06-28 02:21:52,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2024-06-28 02:21:52,917 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2024-06-28 02:21:52,917 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2024-06-28 02:21:52,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:21:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-28 02:21:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-28 02:21:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-28 02:21:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-28 02:21:52,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 02:21:52,921 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:21:52,923 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:21:52,923 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:21:52,926 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 02:21:52,926 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 02:21:52,927 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:21:52 BasicIcfg [2024-06-28 02:21:52,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:21:52,927 INFO L158 Benchmark]: Toolchain (without parser) took 17982.26ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 85.8MB in the beginning and 1.1GB in the end (delta: -983.9MB). Peak memory consumption was 282.4MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,928 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:21:52,928 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:21:52,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.75ms. Allocated memory is still 123.7MB. Free memory was 85.2MB in the beginning and 59.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.96ms. Allocated memory is still 123.7MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,928 INFO L158 Benchmark]: Boogie Preprocessor took 61.79ms. Allocated memory is still 123.7MB. Free memory was 57.3MB in the beginning and 55.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,929 INFO L158 Benchmark]: RCFGBuilder took 407.72ms. Allocated memory is still 123.7MB. Free memory was 55.1MB in the beginning and 89.4MB in the end (delta: -34.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,929 INFO L158 Benchmark]: TraceAbstraction took 16954.48ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 88.7MB in the beginning and 1.1GB in the end (delta: -981.0MB). Peak memory consumption was 286.1MB. Max. memory is 16.1GB. [2024-06-28 02:21:52,930 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.75ms. Allocated memory is still 123.7MB. Free memory was 85.2MB in the beginning and 59.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.96ms. Allocated memory is still 123.7MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.79ms. Allocated memory is still 123.7MB. Free memory was 57.3MB in the beginning and 55.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.72ms. Allocated memory is still 123.7MB. Free memory was 55.1MB in the beginning and 89.4MB in the end (delta: -34.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16954.48ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 88.7MB in the beginning and 1.1GB in the end (delta: -981.0MB). Peak memory consumption was 286.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.9s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4440 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3055 mSDsluCounter, 1857 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6339 IncrementalHoareTripleChecker+Invalid, 6722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 572 mSDtfsCounter, 6339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2810occurred in iteration=18, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 3004 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-28 02:21:52,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE