./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/peterson.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/peterson.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/peterson.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/peterson.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 10:33:35,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 10:33:35,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 10:33:35,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 10:33:35,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 10:33:35,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 10:33:35,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 10:33:35,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 10:33:35,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 10:33:35,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 10:33:35,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 10:33:35,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 10:33:35,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 10:33:35,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 10:33:35,662 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 10:33:35,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 10:33:35,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 10:33:35,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 10:33:35,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 10:33:35,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 10:33:35,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 10:33:35,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 10:33:35,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 10:33:35,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 10:33:35,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 10:33:35,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 10:33:35,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 10:33:35,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 10:33:35,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 10:33:35,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 10:33:35,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 10:33:35,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 10:33:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:33:35,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 10:33:35,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 10:33:35,668 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 10:33:35,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 10:33:35,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 10:33:35,669 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 [2024-05-12 10:33:35,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 10:33:35,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 10:33:35,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 10:33:35,926 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 10:33:35,926 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 10:33:35,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/peterson.yml/witness.yml [2024-05-12 10:33:36,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 10:33:36,073 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 10:33:36,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2024-05-12 10:33:37,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 10:33:37,289 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 10:33:37,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2024-05-12 10:33:37,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7929c02/83d8b0d8c2754c64bb3ba5fc8a1befd2/FLAG42076e8a8 [2024-05-12 10:33:37,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7929c02/83d8b0d8c2754c64bb3ba5fc8a1befd2 [2024-05-12 10:33:37,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 10:33:37,324 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 10:33:37,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 10:33:37,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 10:33:37,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 10:33:37,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:36" (1/2) ... [2024-05-12 10:33:37,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481cc181 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:33:37, skipping insertion in model container [2024-05-12 10:33:37,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:36" (1/2) ... [2024-05-12 10:33:37,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@516971dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:33:37, skipping insertion in model container [2024-05-12 10:33:37,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:33:37" (2/2) ... [2024-05-12 10:33:37,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481cc181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37, skipping insertion in model container [2024-05-12 10:33:37,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:33:37" (2/2) ... [2024-05-12 10:33:37,335 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 10:33:37,362 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 10:33:37,363 INFO L97 edCorrectnessWitness]: Location invariant before [L762-L762] (((((! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((((((((1LL - (long long )flag1) + (long long )flag2 >= 0LL && (1LL - (long long )flag1) + (long long )turn >= 0LL) && (long long )flag1 + (long long )flag2 >= 0LL) && (long long )flag1 + (long long )turn >= 0LL) && (long long )flag2 + (long long )turn >= 0LL) && (1LL + (long long )flag1) - (long long )turn >= 0LL) && (1LL + (long long )flag2) - (long long )turn >= 0LL) && (2LL - (long long )flag1) - (long long )turn >= 0LL))) && (! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1)))) && (! multithreaded || ((((((((0 <= flag1 && 0 <= flag2) && 0 <= turn) && flag1 <= 1) && flag2 <= 1) && turn <= 1) && (flag1 == 0 || flag1 == 1)) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-05-12 10:33:37,364 INFO L97 edCorrectnessWitness]: Location invariant before [L763-L763] (((((! multithreaded || ((0 <= turn && turn <= 1) && (turn == 0 || turn == 1))) && (! multithreaded || ((0 <= flag2 && flag2 <= 1) && (flag2 == 0 || flag2 == 1)))) && (! multithreaded || ((((((((1LL - (long long )flag1) + (long long )flag2 >= 0LL && (1LL - (long long )flag1) + (long long )turn >= 0LL) && (long long )flag1 + (long long )flag2 >= 0LL) && (long long )flag1 + (long long )turn >= 0LL) && (long long )flag2 + (long long )turn >= 0LL) && (1LL + (long long )flag1) - (long long )turn >= 0LL) && (1LL + (long long )flag2) - (long long )turn >= 0LL) && (2LL - (long long )flag1) - (long long )turn >= 0LL))) && (! multithreaded || ((0 <= flag1 && flag1 <= 1) && (flag1 == 0 || flag1 == 1)))) && (! multithreaded || ((((((((0 <= flag1 && 0 <= flag2) && 0 <= turn) && flag1 <= 1) && flag2 <= 1) && turn <= 1) && (flag1 == 0 || flag1 == 1)) && (flag2 == 0 || flag2 == 1)) && (turn == 0 || turn == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1))) [2024-05-12 10:33:37,364 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 10:33:37,364 INFO L106 edCorrectnessWitness]: ghost_update [L761-L761] multithreaded = 1; [2024-05-12 10:33:37,400 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 10:33:37,673 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2024-05-12 10:33:37,680 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] [2024-05-12 10:33:37,687 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:33:37,693 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 10:33:37,760 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2024-05-12 10:33:37,762 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 10:33:37,786 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:33:37,813 INFO L206 MainTranslator]: Completed translation [2024-05-12 10:33:37,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37 WrapperNode [2024-05-12 10:33:37,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 10:33:37,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 10:33:37,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 10:33:37,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 10:33:37,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,851 INFO L138 Inliner]: procedures = 170, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-05-12 10:33:37,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 10:33:37,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 10:33:37,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 10:33:37,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 10:33:37,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,873 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 10:33:37,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 10:33:37,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 10:33:37,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 10:33:37,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 10:33:37,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (1/1) ... [2024-05-12 10:33:37,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:33:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:33:37,919 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-05-12 10:33:37,924 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-05-12 10:33:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 10:33:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 10:33:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 10:33:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-12 10:33:37,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-12 10:33:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-12 10:33:37,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-12 10:33:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 10:33:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 10:33:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 10:33:37,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 10:33:37,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 10:33:37,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 10:33:37,951 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 10:33:38,043 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 10:33:38,045 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 10:33:38,198 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 10:33:38,198 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 10:33:38,273 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 10:33:38,273 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 10:33:38,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:33:38 BoogieIcfgContainer [2024-05-12 10:33:38,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 10:33:38,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 10:33:38,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 10:33:38,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 10:33:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:33:36" (1/4) ... [2024-05-12 10:33:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e74d629 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 10:33:38, skipping insertion in model container [2024-05-12 10:33:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 10:33:37" (2/4) ... [2024-05-12 10:33:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e74d629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:33:38, skipping insertion in model container [2024-05-12 10:33:38,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:33:37" (3/4) ... [2024-05-12 10:33:38,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e74d629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:33:38, skipping insertion in model container [2024-05-12 10:33:38,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:33:38" (4/4) ... [2024-05-12 10:33:38,280 INFO L112 eAbstractionObserver]: Analyzing ICFG peterson.i [2024-05-12 10:33:38,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 10:33:38,294 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 10:33:38,294 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 10:33:38,339 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 10:33:38,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 108 flow [2024-05-12 10:33:38,403 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2024-05-12 10:33:38,403 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 10:33:38,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 4/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-05-12 10:33:38,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 47 transitions, 108 flow [2024-05-12 10:33:38,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 43 transitions, 95 flow [2024-05-12 10:33:38,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 10:33:38,452 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;@79477b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 10:33:38,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-12 10:33:38,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 10:33:38,485 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 10:33:38,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 10:33:38,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:38,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 10:33:38,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:38,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2136088186, now seen corresponding path program 1 times [2024-05-12 10:33:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825104459] [2024-05-12 10:33:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:38,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825104459] [2024-05-12 10:33:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825104459] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 10:33:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620019628] [2024-05-12 10:33:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:38,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:33:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:33:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:33:39,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-05-12 10:33:39,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-05-12 10:33:39,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:39,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-05-12 10:33:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:39,278 INFO L124 PetriNetUnfolderBase]: 213/551 cut-off events. [2024-05-12 10:33:39,279 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-05-12 10:33:39,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 551 events. 213/551 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3136 event pairs, 103 based on Foata normal form. 42/536 useless extension candidates. Maximal degree in co-relation 866. Up to 339 conditions per place. [2024-05-12 10:33:39,294 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 26 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2024-05-12 10:33:39,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 166 flow [2024-05-12 10:33:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:33:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:33:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-05-12 10:33:39,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-05-12 10:33:39,306 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 95 flow. Second operand 3 states and 96 transitions. [2024-05-12 10:33:39,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 166 flow [2024-05-12 10:33:39,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:39,312 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 107 flow [2024-05-12 10:33:39,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-05-12 10:33:39,319 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-05-12 10:33:39,320 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 107 flow [2024-05-12 10:33:39,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-05-12 10:33:39,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:39,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 10:33:39,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:39,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -212082223, now seen corresponding path program 1 times [2024-05-12 10:33:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266498549] [2024-05-12 10:33:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266498549] [2024-05-12 10:33:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266498549] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:33:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275411806] [2024-05-12 10:33:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:39,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:33:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:33:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:33:39,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-05-12 10:33:39,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-05-12 10:33:39,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:39,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-05-12 10:33:39,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:39,755 INFO L124 PetriNetUnfolderBase]: 245/603 cut-off events. [2024-05-12 10:33:39,755 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-05-12 10:33:39,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 603 events. 245/603 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3379 event pairs, 106 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 964. Up to 382 conditions per place. [2024-05-12 10:33:39,778 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 32 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-05-12 10:33:39,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 211 flow [2024-05-12 10:33:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:33:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:33:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-05-12 10:33:39,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6329787234042553 [2024-05-12 10:33:39,784 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 107 flow. Second operand 4 states and 119 transitions. [2024-05-12 10:33:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 211 flow [2024-05-12 10:33:39,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:39,786 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 131 flow [2024-05-12 10:33:39,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-05-12 10:33:39,792 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-05-12 10:33:39,792 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 131 flow [2024-05-12 10:33:39,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-05-12 10:33:39,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:39,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:39,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 10:33:39,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:39,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2015386970, now seen corresponding path program 1 times [2024-05-12 10:33:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149272031] [2024-05-12 10:33:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:39,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149272031] [2024-05-12 10:33:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149272031] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:40,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:33:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733655746] [2024-05-12 10:33:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:33:40,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:40,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:33:40,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:33:40,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:40,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-05-12 10:33:40,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:40,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:40,278 INFO L124 PetriNetUnfolderBase]: 272/608 cut-off events. [2024-05-12 10:33:40,278 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-05-12 10:33:40,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 608 events. 272/608 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3216 event pairs, 99 based on Foata normal form. 10/607 useless extension candidates. Maximal degree in co-relation 1063. Up to 378 conditions per place. [2024-05-12 10:33:40,282 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 39 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-05-12 10:33:40,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 276 flow [2024-05-12 10:33:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:33:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:33:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-05-12 10:33:40,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6127659574468085 [2024-05-12 10:33:40,284 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 131 flow. Second operand 5 states and 144 transitions. [2024-05-12 10:33:40,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 276 flow [2024-05-12 10:33:40,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:40,286 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 157 flow [2024-05-12 10:33:40,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-05-12 10:33:40,287 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-05-12 10:33:40,287 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 157 flow [2024-05-12 10:33:40,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-05-12 10:33:40,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:40,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:40,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 10:33:40,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:40,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1409831179, now seen corresponding path program 1 times [2024-05-12 10:33:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:40,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409482218] [2024-05-12 10:33:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409482218] [2024-05-12 10:33:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409482218] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:33:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620382807] [2024-05-12 10:33:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:40,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:33:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:33:40,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:33:40,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-05-12 10:33:40,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-05-12 10:33:40,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:40,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-05-12 10:33:40,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:40,543 INFO L124 PetriNetUnfolderBase]: 241/555 cut-off events. [2024-05-12 10:33:40,544 INFO L125 PetriNetUnfolderBase]: For 361/375 co-relation queries the response was YES. [2024-05-12 10:33:40,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 555 events. 241/555 cut-off events. For 361/375 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2932 event pairs, 94 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1119. Up to 381 conditions per place. [2024-05-12 10:33:40,548 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-05-12 10:33:40,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 253 flow [2024-05-12 10:33:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 10:33:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 10:33:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-05-12 10:33:40,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2024-05-12 10:33:40,551 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 157 flow. Second operand 4 states and 115 transitions. [2024-05-12 10:33:40,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 253 flow [2024-05-12 10:33:40,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 241 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:40,556 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 170 flow [2024-05-12 10:33:40,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-05-12 10:33:40,557 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-05-12 10:33:40,557 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 170 flow [2024-05-12 10:33:40,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-05-12 10:33:40,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:40,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:40,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 10:33:40,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:40,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1947411018, now seen corresponding path program 1 times [2024-05-12 10:33:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008689685] [2024-05-12 10:33:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008689685] [2024-05-12 10:33:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008689685] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:40,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:40,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:33:40,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876852858] [2024-05-12 10:33:40,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:33:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:33:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:33:40,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:40,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 10:33:40,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:40,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:40,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:40,822 INFO L124 PetriNetUnfolderBase]: 273/592 cut-off events. [2024-05-12 10:33:40,825 INFO L125 PetriNetUnfolderBase]: For 569/586 co-relation queries the response was YES. [2024-05-12 10:33:40,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 592 events. 273/592 cut-off events. For 569/586 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3016 event pairs, 109 based on Foata normal form. 3/578 useless extension candidates. Maximal degree in co-relation 1287. Up to 419 conditions per place. [2024-05-12 10:33:40,829 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 39 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-05-12 10:33:40,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 322 flow [2024-05-12 10:33:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:33:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:33:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-05-12 10:33:40,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-05-12 10:33:40,831 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 170 flow. Second operand 5 states and 141 transitions. [2024-05-12 10:33:40,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 322 flow [2024-05-12 10:33:40,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:40,835 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 206 flow [2024-05-12 10:33:40,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-05-12 10:33:40,837 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-05-12 10:33:40,837 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 206 flow [2024-05-12 10:33:40,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 10:33:40,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:40,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:40,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 10:33:40,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:40,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720238, now seen corresponding path program 2 times [2024-05-12 10:33:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116273143] [2024-05-12 10:33:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116273143] [2024-05-12 10:33:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116273143] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 10:33:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786186890] [2024-05-12 10:33:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:33:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:33:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:33:41,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:41,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 10:33:41,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:41,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:41,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:41,111 INFO L124 PetriNetUnfolderBase]: 273/602 cut-off events. [2024-05-12 10:33:41,111 INFO L125 PetriNetUnfolderBase]: For 849/865 co-relation queries the response was YES. [2024-05-12 10:33:41,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 602 events. 273/602 cut-off events. For 849/865 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3112 event pairs, 112 based on Foata normal form. 9/596 useless extension candidates. Maximal degree in co-relation 1137. Up to 417 conditions per place. [2024-05-12 10:33:41,114 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 35 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-05-12 10:33:41,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 316 flow [2024-05-12 10:33:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:33:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:33:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-05-12 10:33:41,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5829787234042553 [2024-05-12 10:33:41,115 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 206 flow. Second operand 5 states and 137 transitions. [2024-05-12 10:33:41,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 316 flow [2024-05-12 10:33:41,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 306 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:41,117 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 221 flow [2024-05-12 10:33:41,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-05-12 10:33:41,118 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-05-12 10:33:41,118 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 221 flow [2024-05-12 10:33:41,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 10:33:41,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:41,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:41,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 10:33:41,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:41,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1077928913, now seen corresponding path program 1 times [2024-05-12 10:33:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061112306] [2024-05-12 10:33:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061112306] [2024-05-12 10:33:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061112306] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214540884] [2024-05-12 10:33:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:41,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:41,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:41,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:41,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:41,400 INFO L124 PetriNetUnfolderBase]: 388/868 cut-off events. [2024-05-12 10:33:41,400 INFO L125 PetriNetUnfolderBase]: For 1427/1446 co-relation queries the response was YES. [2024-05-12 10:33:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 868 events. 388/868 cut-off events. For 1427/1446 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5000 event pairs, 83 based on Foata normal form. 59/912 useless extension candidates. Maximal degree in co-relation 1992. Up to 298 conditions per place. [2024-05-12 10:33:41,404 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 51 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-05-12 10:33:41,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 488 flow [2024-05-12 10:33:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-05-12 10:33:41,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2024-05-12 10:33:41,405 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 221 flow. Second operand 6 states and 177 transitions. [2024-05-12 10:33:41,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 488 flow [2024-05-12 10:33:41,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 463 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:41,408 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 332 flow [2024-05-12 10:33:41,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 10:33:41,408 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-05-12 10:33:41,409 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 332 flow [2024-05-12 10:33:41,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:41,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:41,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 10:33:41,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:41,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -246877933, now seen corresponding path program 2 times [2024-05-12 10:33:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270983207] [2024-05-12 10:33:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:41,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270983207] [2024-05-12 10:33:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270983207] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:41,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146963700] [2024-05-12 10:33:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:41,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:41,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:41,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:41,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:41,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:41,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:41,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:41,671 INFO L124 PetriNetUnfolderBase]: 434/988 cut-off events. [2024-05-12 10:33:41,682 INFO L125 PetriNetUnfolderBase]: For 2753/2782 co-relation queries the response was YES. [2024-05-12 10:33:41,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 988 events. 434/988 cut-off events. For 2753/2782 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5963 event pairs, 89 based on Foata normal form. 22/990 useless extension candidates. Maximal degree in co-relation 2701. Up to 312 conditions per place. [2024-05-12 10:33:41,687 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2024-05-12 10:33:41,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 625 flow [2024-05-12 10:33:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 10:33:41,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 10:33:41,689 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 332 flow. Second operand 6 states and 170 transitions. [2024-05-12 10:33:41,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 625 flow [2024-05-12 10:33:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 619 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-05-12 10:33:41,694 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 420 flow [2024-05-12 10:33:41,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-05-12 10:33:41,694 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2024-05-12 10:33:41,695 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 420 flow [2024-05-12 10:33:41,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:41,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:41,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 10:33:41,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:41,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -647701423, now seen corresponding path program 3 times [2024-05-12 10:33:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557178707] [2024-05-12 10:33:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557178707] [2024-05-12 10:33:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557178707] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672830266] [2024-05-12 10:33:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:41,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:41,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:41,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:41,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:41,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:41,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:41,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:41,951 INFO L124 PetriNetUnfolderBase]: 421/964 cut-off events. [2024-05-12 10:33:41,951 INFO L125 PetriNetUnfolderBase]: For 3546/3576 co-relation queries the response was YES. [2024-05-12 10:33:41,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 964 events. 421/964 cut-off events. For 3546/3576 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5770 event pairs, 79 based on Foata normal form. 13/964 useless extension candidates. Maximal degree in co-relation 2196. Up to 310 conditions per place. [2024-05-12 10:33:41,957 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 55 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2024-05-12 10:33:41,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 674 flow [2024-05-12 10:33:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 10:33:41,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 10:33:41,958 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 420 flow. Second operand 6 states and 170 transitions. [2024-05-12 10:33:41,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 674 flow [2024-05-12 10:33:41,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 646 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:41,964 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 436 flow [2024-05-12 10:33:41,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-05-12 10:33:41,965 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-05-12 10:33:41,965 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 436 flow [2024-05-12 10:33:41,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:41,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:41,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:41,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 10:33:41,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:41,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1676968692, now seen corresponding path program 1 times [2024-05-12 10:33:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514659632] [2024-05-12 10:33:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514659632] [2024-05-12 10:33:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514659632] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:42,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:42,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236302788] [2024-05-12 10:33:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:42,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:42,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:42,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05-12 10:33:42,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:42,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:42,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:42,225 INFO L124 PetriNetUnfolderBase]: 468/1110 cut-off events. [2024-05-12 10:33:42,226 INFO L125 PetriNetUnfolderBase]: For 4375/4414 co-relation queries the response was YES. [2024-05-12 10:33:42,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 1110 events. 468/1110 cut-off events. For 4375/4414 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7029 event pairs, 76 based on Foata normal form. 16/1114 useless extension candidates. Maximal degree in co-relation 2466. Up to 399 conditions per place. [2024-05-12 10:33:42,232 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 74 selfloop transitions, 13 changer transitions 2/105 dead transitions. [2024-05-12 10:33:42,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 800 flow [2024-05-12 10:33:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2024-05-12 10:33:42,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6134751773049646 [2024-05-12 10:33:42,234 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 436 flow. Second operand 6 states and 173 transitions. [2024-05-12 10:33:42,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 800 flow [2024-05-12 10:33:42,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 750 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:42,240 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 471 flow [2024-05-12 10:33:42,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-05-12 10:33:42,241 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-05-12 10:33:42,241 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 471 flow [2024-05-12 10:33:42,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05-12 10:33:42,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:42,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:42,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 10:33:42,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:42,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -943940549, now seen corresponding path program 1 times [2024-05-12 10:33:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032996771] [2024-05-12 10:33:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032996771] [2024-05-12 10:33:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032996771] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377530376] [2024-05-12 10:33:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:42,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:42,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:42,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:42,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:42,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:42,497 INFO L124 PetriNetUnfolderBase]: 456/1068 cut-off events. [2024-05-12 10:33:42,498 INFO L125 PetriNetUnfolderBase]: For 4569/4600 co-relation queries the response was YES. [2024-05-12 10:33:42,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 1068 events. 456/1068 cut-off events. For 4569/4600 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6640 event pairs, 116 based on Foata normal form. 26/1076 useless extension candidates. Maximal degree in co-relation 2737. Up to 318 conditions per place. [2024-05-12 10:33:42,503 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 52 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2024-05-12 10:33:42,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 744 flow [2024-05-12 10:33:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 10:33:42,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 10:33:42,504 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 471 flow. Second operand 6 states and 168 transitions. [2024-05-12 10:33:42,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 744 flow [2024-05-12 10:33:42,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 730 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:42,511 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 550 flow [2024-05-12 10:33:42,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2024-05-12 10:33:42,511 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2024-05-12 10:33:42,511 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 550 flow [2024-05-12 10:33:42,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:42,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:42,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:42,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 10:33:42,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:42,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2095410143, now seen corresponding path program 2 times [2024-05-12 10:33:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498816119] [2024-05-12 10:33:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498816119] [2024-05-12 10:33:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498816119] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:42,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:42,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:42,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198747837] [2024-05-12 10:33:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:42,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:42,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:42,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:42,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:42,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:42,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:42,759 INFO L124 PetriNetUnfolderBase]: 463/1106 cut-off events. [2024-05-12 10:33:42,759 INFO L125 PetriNetUnfolderBase]: For 5584/5613 co-relation queries the response was YES. [2024-05-12 10:33:42,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3711 conditions, 1106 events. 463/1106 cut-off events. For 5584/5613 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6945 event pairs, 103 based on Foata normal form. 13/1109 useless extension candidates. Maximal degree in co-relation 2751. Up to 319 conditions per place. [2024-05-12 10:33:42,765 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 57 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2024-05-12 10:33:42,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 837 flow [2024-05-12 10:33:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 10:33:42,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 10:33:42,766 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 550 flow. Second operand 6 states and 168 transitions. [2024-05-12 10:33:42,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 837 flow [2024-05-12 10:33:42,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 769 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 10:33:42,773 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 578 flow [2024-05-12 10:33:42,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2024-05-12 10:33:42,774 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places. [2024-05-12 10:33:42,774 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 578 flow [2024-05-12 10:33:42,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:42,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:42,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:42,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 10:33:42,775 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:42,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1385472396, now seen corresponding path program 1 times [2024-05-12 10:33:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:42,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024571350] [2024-05-12 10:33:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:42,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024571350] [2024-05-12 10:33:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024571350] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614078926] [2024-05-12 10:33:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:42,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:42,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:42,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:42,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:42,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:42,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:42,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:43,114 INFO L124 PetriNetUnfolderBase]: 606/1332 cut-off events. [2024-05-12 10:33:43,115 INFO L125 PetriNetUnfolderBase]: For 7729/7758 co-relation queries the response was YES. [2024-05-12 10:33:43,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 1332 events. 606/1332 cut-off events. For 7729/7758 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8380 event pairs, 196 based on Foata normal form. 27/1343 useless extension candidates. Maximal degree in co-relation 3919. Up to 535 conditions per place. [2024-05-12 10:33:43,143 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 64 selfloop transitions, 21 changer transitions 6/107 dead transitions. [2024-05-12 10:33:43,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 938 flow [2024-05-12 10:33:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-05-12 10:33:43,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-05-12 10:33:43,145 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 578 flow. Second operand 6 states and 169 transitions. [2024-05-12 10:33:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 938 flow [2024-05-12 10:33:43,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 107 transitions, 889 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:43,155 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 640 flow [2024-05-12 10:33:43,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-05-12 10:33:43,156 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places. [2024-05-12 10:33:43,156 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 640 flow [2024-05-12 10:33:43,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 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-05-12 10:33:43,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:43,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:43,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 10:33:43,157 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:43,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 411927719, now seen corresponding path program 1 times [2024-05-12 10:33:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63460852] [2024-05-12 10:33:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63460852] [2024-05-12 10:33:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63460852] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:43,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:43,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 10:33:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118892528] [2024-05-12 10:33:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:43,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:43,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:43,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:43,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:43,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:43,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:43,488 INFO L124 PetriNetUnfolderBase]: 803/1720 cut-off events. [2024-05-12 10:33:43,488 INFO L125 PetriNetUnfolderBase]: For 7075/7085 co-relation queries the response was YES. [2024-05-12 10:33:43,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5493 conditions, 1720 events. 803/1720 cut-off events. For 7075/7085 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11338 event pairs, 200 based on Foata normal form. 51/1732 useless extension candidates. Maximal degree in co-relation 4753. Up to 451 conditions per place. [2024-05-12 10:33:43,502 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 78 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-05-12 10:33:43,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 140 transitions, 1100 flow [2024-05-12 10:33:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 10:33:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 10:33:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 280 transitions. [2024-05-12 10:33:43,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 10:33:43,504 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 640 flow. Second operand 10 states and 280 transitions. [2024-05-12 10:33:43,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 140 transitions, 1100 flow [2024-05-12 10:33:43,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 140 transitions, 1068 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:43,519 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 899 flow [2024-05-12 10:33:43,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=899, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2024-05-12 10:33:43,520 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-05-12 10:33:43,520 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 899 flow [2024-05-12 10:33:43,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:43,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:43,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:43,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 10:33:43,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:43,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -914918837, now seen corresponding path program 2 times [2024-05-12 10:33:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:43,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447720004] [2024-05-12 10:33:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:43,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447720004] [2024-05-12 10:33:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447720004] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:43,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121101267] [2024-05-12 10:33:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:43,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:43,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:43,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 899 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:43,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:43,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:43,862 INFO L124 PetriNetUnfolderBase]: 765/1715 cut-off events. [2024-05-12 10:33:43,862 INFO L125 PetriNetUnfolderBase]: For 12543/12594 co-relation queries the response was YES. [2024-05-12 10:33:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7024 conditions, 1715 events. 765/1715 cut-off events. For 12543/12594 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11704 event pairs, 256 based on Foata normal form. 15/1703 useless extension candidates. Maximal degree in co-relation 5907. Up to 500 conditions per place. [2024-05-12 10:33:43,877 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 71 selfloop transitions, 30 changer transitions 2/128 dead transitions. [2024-05-12 10:33:43,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 128 transitions, 1323 flow [2024-05-12 10:33:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 10:33:43,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 10:33:43,879 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 899 flow. Second operand 6 states and 170 transitions. [2024-05-12 10:33:43,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 128 transitions, 1323 flow [2024-05-12 10:33:43,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 128 transitions, 1323 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 10:33:43,901 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 1012 flow [2024-05-12 10:33:43,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1012, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-05-12 10:33:43,902 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 70 predicate places. [2024-05-12 10:33:43,902 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 1012 flow [2024-05-12 10:33:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:43,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:43,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 10:33:43,903 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:43,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1079164697, now seen corresponding path program 3 times [2024-05-12 10:33:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118394033] [2024-05-12 10:33:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:44,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118394033] [2024-05-12 10:33:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118394033] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:44,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:44,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610946808] [2024-05-12 10:33:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:44,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:44,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:44,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 1012 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:44,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:44,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:44,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:44,255 INFO L124 PetriNetUnfolderBase]: 795/1753 cut-off events. [2024-05-12 10:33:44,255 INFO L125 PetriNetUnfolderBase]: For 14833/14925 co-relation queries the response was YES. [2024-05-12 10:33:44,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7651 conditions, 1753 events. 795/1753 cut-off events. For 14833/14925 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11852 event pairs, 240 based on Foata normal form. 28/1742 useless extension candidates. Maximal degree in co-relation 6369. Up to 559 conditions per place. [2024-05-12 10:33:44,266 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 67 selfloop transitions, 31 changer transitions 6/129 dead transitions. [2024-05-12 10:33:44,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 129 transitions, 1406 flow [2024-05-12 10:33:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-05-12 10:33:44,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2024-05-12 10:33:44,268 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 1012 flow. Second operand 6 states and 171 transitions. [2024-05-12 10:33:44,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 129 transitions, 1406 flow [2024-05-12 10:33:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 129 transitions, 1370 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:44,290 INFO L231 Difference]: Finished difference. Result has 122 places, 103 transitions, 1093 flow [2024-05-12 10:33:44,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1093, PETRI_PLACES=122, PETRI_TRANSITIONS=103} [2024-05-12 10:33:44,290 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places. [2024-05-12 10:33:44,291 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 103 transitions, 1093 flow [2024-05-12 10:33:44,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:44,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:44,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 10:33:44,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:44,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1318035796, now seen corresponding path program 1 times [2024-05-12 10:33:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986102240] [2024-05-12 10:33:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986102240] [2024-05-12 10:33:44,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986102240] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:44,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:44,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:33:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265265408] [2024-05-12 10:33:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:44,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:44,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 103 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:44,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:44,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:44,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:44,654 INFO L124 PetriNetUnfolderBase]: 825/1828 cut-off events. [2024-05-12 10:33:44,654 INFO L125 PetriNetUnfolderBase]: For 18914/19007 co-relation queries the response was YES. [2024-05-12 10:33:44,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8339 conditions, 1828 events. 825/1828 cut-off events. For 18914/19007 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12509 event pairs, 150 based on Foata normal form. 15/1789 useless extension candidates. Maximal degree in co-relation 8111. Up to 595 conditions per place. [2024-05-12 10:33:44,667 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 76 selfloop transitions, 29 changer transitions 6/136 dead transitions. [2024-05-12 10:33:44,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 1529 flow [2024-05-12 10:33:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-05-12 10:33:44,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-05-12 10:33:44,668 INFO L175 Difference]: Start difference. First operand has 122 places, 103 transitions, 1093 flow. Second operand 6 states and 172 transitions. [2024-05-12 10:33:44,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 1529 flow [2024-05-12 10:33:44,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 1489 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:44,696 INFO L231 Difference]: Finished difference. Result has 129 places, 106 transitions, 1200 flow [2024-05-12 10:33:44,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1200, PETRI_PLACES=129, PETRI_TRANSITIONS=106} [2024-05-12 10:33:44,696 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 83 predicate places. [2024-05-12 10:33:44,697 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 106 transitions, 1200 flow [2024-05-12 10:33:44,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-05-12 10:33:44,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:44,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:44,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 10:33:44,697 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:44,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1216506758, now seen corresponding path program 1 times [2024-05-12 10:33:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:44,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812903596] [2024-05-12 10:33:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:44,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812903596] [2024-05-12 10:33:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812903596] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:44,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946026975] [2024-05-12 10:33:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:44,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:44,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:44,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:44,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 106 transitions, 1200 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:44,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:44,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:44,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:45,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 6#L763true, Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,059 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,059 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 6#L763true, Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,060 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [24#L728true, Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 43#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 198#true, Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,061 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), 20#L753true, Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, 17#L763-2true, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,061 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,061 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, 17#L763-2true, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,062 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 43#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,062 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,063 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,063 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,063 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 27#L763-3true, Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,074 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-05-12 10:33:45,074 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,074 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,074 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 10:33:45,078 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), 24#L728true, Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L763-2true, Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,078 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,078 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,078 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,078 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:33:45,078 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, 11#L764-1true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,083 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 10:33:45,083 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 10:33:45,083 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,083 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 39#thr1EXITtrue, 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), 17#L763-2true, Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,085 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,085 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,085 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 10:33:45,085 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:33:45,088 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), 190#(= ~flag1~0 0), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 73#true, Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), 27#L763-3true, Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,088 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-05-12 10:33:45,088 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 10:33:45,088 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,088 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:33:45,089 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-05-12 10:33:45,090 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([200] L750-->L753: Formula: (and (or (not (= v_thr2Thread1of1ForFork1_~t2~0_5 0)) (not (= v_thr2Thread1of1ForFork1_~f12~0_5 1))) (= v_~x~0_34 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_5, ~x~0=v_~x~0_34, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_5} AuxVars[] AssignedVars[~x~0][106], [Black: 193#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1) (= ~flag2~0 0)), Black: 66#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1) (= ~flag2~0 0)), Black: 192#(and (= ~flag1~0 0) (= ~turn~0 0) (= ~x~0 1)), 20#L753true, Black: 191#(and (= ~flag1~0 0) (= ~turn~0 0)), Black: 132#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 133#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 145#true, 190#(= ~flag1~0 0), Black: 71#(and (= ~flag1~0 0) (= ~x~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 77#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 139#(and (= ~flag1~0 0) (= ~flag2~0 1)), Black: 140#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0)), Black: 141#(and (= ~flag1~0 0) (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 83#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), 138#(= ~flag1~0 0), Black: 90#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 88#(and (= ~x~0 0) (= ~flag1~0 1)), Black: 87#(= ~x~0 0), Black: 89#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag1~0 1)), Black: 147#(= ~flag1~0 1), Black: 161#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 101#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 157#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), Black: 148#(and (= ~flag1~0 1) (= ~turn~0 0)), 73#true, Black: 149#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~turn~0 0)), Black: 152#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= ~flag1~0 1) (= ~turn~0 0)), Black: 150#(and (= thr2Thread1of1ForFork1_~f12~0 1) (= thr2Thread1of1ForFork1_~t2~0 0)), 173#(= ~flag2~0 1), Black: 108#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 175#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0)), thr2Thread1of1ForFork1InUse, Black: 176#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 113#(and (= ~turn~0 1) (= ~flag2~0 0)), Black: 115#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), 85#true, Black: 114#(and (= ~x~0 0) (= ~turn~0 1) (= ~flag2~0 0)), Black: 55#(and (= ~flag1~0 0) (= ~x~0 0) (= ~turn~0 0) (= ~flag2~0 0)), Black: 183#(and (= ~flag2~0 1) (= ~turn~0 0) (= ~x~0 1)), 11#L764-1true, Black: 182#(and (= ~flag2~0 1) (= ~turn~0 0)), 198#true, Black: 184#(and (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0) (= ~x~0 1)), Black: 60#(and (= ~x~0 0) (= ~flag1~0 1) (= ~turn~0 0) (= ~flag2~0 0)), Black: 124#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1)), Black: 125#(and (= ~x~0 0) (= ~flag2~0 1) (= ~flag1~0 1) (= ~turn~0 0))]) [2024-05-12 10:33:45,090 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-05-12 10:33:45,090 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 10:33:45,090 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,090 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:33:45,091 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-05-12 10:33:45,091 INFO L124 PetriNetUnfolderBase]: 878/1948 cut-off events. [2024-05-12 10:33:45,091 INFO L125 PetriNetUnfolderBase]: For 24168/24300 co-relation queries the response was YES. [2024-05-12 10:33:45,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9215 conditions, 1948 events. 878/1948 cut-off events. For 24168/24300 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13715 event pairs, 324 based on Foata normal form. 32/1921 useless extension candidates. Maximal degree in co-relation 8324. Up to 747 conditions per place. [2024-05-12 10:33:45,105 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 72 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2024-05-12 10:33:45,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 1600 flow [2024-05-12 10:33:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-05-12 10:33:45,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-05-12 10:33:45,107 INFO L175 Difference]: Start difference. First operand has 129 places, 106 transitions, 1200 flow. Second operand 6 states and 169 transitions. [2024-05-12 10:33:45,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 1600 flow [2024-05-12 10:33:45,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 132 transitions, 1514 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:45,145 INFO L231 Difference]: Finished difference. Result has 132 places, 111 transitions, 1261 flow [2024-05-12 10:33:45,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1261, PETRI_PLACES=132, PETRI_TRANSITIONS=111} [2024-05-12 10:33:45,146 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 86 predicate places. [2024-05-12 10:33:45,146 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 1261 flow [2024-05-12 10:33:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:45,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:45,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:45,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 10:33:45,147 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:45,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash 782100618, now seen corresponding path program 2 times [2024-05-12 10:33:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270708334] [2024-05-12 10:33:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270708334] [2024-05-12 10:33:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270708334] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932904377] [2024-05-12 10:33:45,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:45,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:45,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:45,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:45,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 1261 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:45,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:45,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:45,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:45,527 INFO L124 PetriNetUnfolderBase]: 865/1938 cut-off events. [2024-05-12 10:33:45,528 INFO L125 PetriNetUnfolderBase]: For 23514/23633 co-relation queries the response was YES. [2024-05-12 10:33:45,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 1938 events. 865/1938 cut-off events. For 23514/23633 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13673 event pairs, 256 based on Foata normal form. 37/1924 useless extension candidates. Maximal degree in co-relation 8213. Up to 637 conditions per place. [2024-05-12 10:33:45,542 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 73 selfloop transitions, 36 changer transitions 2/136 dead transitions. [2024-05-12 10:33:45,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 136 transitions, 1684 flow [2024-05-12 10:33:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-05-12 10:33:45,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-05-12 10:33:45,544 INFO L175 Difference]: Start difference. First operand has 132 places, 111 transitions, 1261 flow. Second operand 6 states and 170 transitions. [2024-05-12 10:33:45,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 136 transitions, 1684 flow [2024-05-12 10:33:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 136 transitions, 1639 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:45,583 INFO L231 Difference]: Finished difference. Result has 137 places, 116 transitions, 1378 flow [2024-05-12 10:33:45,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=137, PETRI_TRANSITIONS=116} [2024-05-12 10:33:45,584 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 91 predicate places. [2024-05-12 10:33:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 116 transitions, 1378 flow [2024-05-12 10:33:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:45,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:45,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:45,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 10:33:45,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:45,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -988781036, now seen corresponding path program 3 times [2024-05-12 10:33:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157269814] [2024-05-12 10:33:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:45,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157269814] [2024-05-12 10:33:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157269814] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 10:33:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950435259] [2024-05-12 10:33:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:45,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 116 transitions, 1378 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-12 10:33:45,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:45,981 INFO L124 PetriNetUnfolderBase]: 1085/2300 cut-off events. [2024-05-12 10:33:45,982 INFO L125 PetriNetUnfolderBase]: For 21807/21874 co-relation queries the response was YES. [2024-05-12 10:33:45,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10047 conditions, 2300 events. 1085/2300 cut-off events. For 21807/21874 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16250 event pairs, 232 based on Foata normal form. 32/2289 useless extension candidates. Maximal degree in co-relation 9812. Up to 670 conditions per place. [2024-05-12 10:33:45,997 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 102 selfloop transitions, 43 changer transitions 4/178 dead transitions. [2024-05-12 10:33:45,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 178 transitions, 2008 flow [2024-05-12 10:33:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 10:33:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 10:33:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-05-12 10:33:45,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-05-12 10:33:45,999 INFO L175 Difference]: Start difference. First operand has 137 places, 116 transitions, 1378 flow. Second operand 8 states and 235 transitions. [2024-05-12 10:33:45,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 178 transitions, 2008 flow [2024-05-12 10:33:46,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 178 transitions, 1957 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:46,046 INFO L231 Difference]: Finished difference. Result has 148 places, 132 transitions, 1637 flow [2024-05-12 10:33:46,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1637, PETRI_PLACES=148, PETRI_TRANSITIONS=132} [2024-05-12 10:33:46,047 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 102 predicate places. [2024-05-12 10:33:46,047 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 132 transitions, 1637 flow [2024-05-12 10:33:46,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-12 10:33:46,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:46,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 10:33:46,048 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:46,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1702289106, now seen corresponding path program 4 times [2024-05-12 10:33:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530847820] [2024-05-12 10:33:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530847820] [2024-05-12 10:33:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530847820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934580085] [2024-05-12 10:33:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:46,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:46,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:46,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 132 transitions, 1637 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:46,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:46,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:46,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:46,463 INFO L124 PetriNetUnfolderBase]: 940/2132 cut-off events. [2024-05-12 10:33:46,463 INFO L125 PetriNetUnfolderBase]: For 29788/29900 co-relation queries the response was YES. [2024-05-12 10:33:46,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10822 conditions, 2132 events. 940/2132 cut-off events. For 29788/29900 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15581 event pairs, 290 based on Foata normal form. 6/2093 useless extension candidates. Maximal degree in co-relation 9605. Up to 685 conditions per place. [2024-05-12 10:33:46,479 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 32 changer transitions 2/152 dead transitions. [2024-05-12 10:33:46,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 152 transitions, 2028 flow [2024-05-12 10:33:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-05-12 10:33:46,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5886524822695035 [2024-05-12 10:33:46,481 INFO L175 Difference]: Start difference. First operand has 148 places, 132 transitions, 1637 flow. Second operand 6 states and 166 transitions. [2024-05-12 10:33:46,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 152 transitions, 2028 flow [2024-05-12 10:33:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 152 transitions, 1999 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-05-12 10:33:46,540 INFO L231 Difference]: Finished difference. Result has 153 places, 134 transitions, 1703 flow [2024-05-12 10:33:46,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1703, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2024-05-12 10:33:46,540 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 107 predicate places. [2024-05-12 10:33:46,541 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 1703 flow [2024-05-12 10:33:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:46,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:46,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 10:33:46,541 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:46,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 905634742, now seen corresponding path program 5 times [2024-05-12 10:33:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310512221] [2024-05-12 10:33:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310512221] [2024-05-12 10:33:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310512221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:46,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:46,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:46,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600931807] [2024-05-12 10:33:46,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:46,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:46,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:46,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:46,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:46,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 1703 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:46,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:46,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:46,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:46,967 INFO L124 PetriNetUnfolderBase]: 918/2097 cut-off events. [2024-05-12 10:33:46,968 INFO L125 PetriNetUnfolderBase]: For 31960/32037 co-relation queries the response was YES. [2024-05-12 10:33:46,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 2097 events. 918/2097 cut-off events. For 31960/32037 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15257 event pairs, 265 based on Foata normal form. 16/2073 useless extension candidates. Maximal degree in co-relation 9761. Up to 756 conditions per place. [2024-05-12 10:33:46,982 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 79 selfloop transitions, 32 changer transitions 4/154 dead transitions. [2024-05-12 10:33:46,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 154 transitions, 2088 flow [2024-05-12 10:33:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-05-12 10:33:46,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2024-05-12 10:33:46,983 INFO L175 Difference]: Start difference. First operand has 153 places, 134 transitions, 1703 flow. Second operand 6 states and 165 transitions. [2024-05-12 10:33:46,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 154 transitions, 2088 flow [2024-05-12 10:33:47,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 2028 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:47,039 INFO L231 Difference]: Finished difference. Result has 157 places, 137 transitions, 1777 flow [2024-05-12 10:33:47,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1777, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2024-05-12 10:33:47,039 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 111 predicate places. [2024-05-12 10:33:47,040 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 1777 flow [2024-05-12 10:33:47,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:47,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:47,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 10:33:47,040 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:47,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 216432201, now seen corresponding path program 1 times [2024-05-12 10:33:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793509568] [2024-05-12 10:33:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793509568] [2024-05-12 10:33:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793509568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:47,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101629991] [2024-05-12 10:33:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:47,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:47,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:47,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:47,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:47,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:47,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 137 transitions, 1777 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:47,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:47,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:47,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:47,483 INFO L124 PetriNetUnfolderBase]: 924/2109 cut-off events. [2024-05-12 10:33:47,483 INFO L125 PetriNetUnfolderBase]: For 36246/36333 co-relation queries the response was YES. [2024-05-12 10:33:47,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11005 conditions, 2109 events. 924/2109 cut-off events. For 36246/36333 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15281 event pairs, 229 based on Foata normal form. 10/2081 useless extension candidates. Maximal degree in co-relation 10157. Up to 502 conditions per place. [2024-05-12 10:33:47,499 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 88 selfloop transitions, 45 changer transitions 4/176 dead transitions. [2024-05-12 10:33:47,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 176 transitions, 2358 flow [2024-05-12 10:33:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-05-12 10:33:47,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6453900709219859 [2024-05-12 10:33:47,500 INFO L175 Difference]: Start difference. First operand has 157 places, 137 transitions, 1777 flow. Second operand 6 states and 182 transitions. [2024-05-12 10:33:47,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 176 transitions, 2358 flow [2024-05-12 10:33:47,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 176 transitions, 2306 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:47,564 INFO L231 Difference]: Finished difference. Result has 162 places, 143 transitions, 1987 flow [2024-05-12 10:33:47,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1987, PETRI_PLACES=162, PETRI_TRANSITIONS=143} [2024-05-12 10:33:47,565 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 116 predicate places. [2024-05-12 10:33:47,565 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 143 transitions, 1987 flow [2024-05-12 10:33:47,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:47,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:47,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:47,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 10:33:47,566 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:47,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1282095651, now seen corresponding path program 2 times [2024-05-12 10:33:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881661609] [2024-05-12 10:33:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:47,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881661609] [2024-05-12 10:33:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881661609] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:47,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304523122] [2024-05-12 10:33:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:47,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:47,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:47,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 143 transitions, 1987 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:47,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:47,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:48,008 INFO L124 PetriNetUnfolderBase]: 934/2127 cut-off events. [2024-05-12 10:33:48,008 INFO L125 PetriNetUnfolderBase]: For 41723/41842 co-relation queries the response was YES. [2024-05-12 10:33:48,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11571 conditions, 2127 events. 934/2127 cut-off events. For 41723/41842 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15411 event pairs, 236 based on Foata normal form. 22/2109 useless extension candidates. Maximal degree in co-relation 10729. Up to 513 conditions per place. [2024-05-12 10:33:48,026 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 93 selfloop transitions, 39 changer transitions 6/177 dead transitions. [2024-05-12 10:33:48,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 2478 flow [2024-05-12 10:33:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-05-12 10:33:48,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2024-05-12 10:33:48,027 INFO L175 Difference]: Start difference. First operand has 162 places, 143 transitions, 1987 flow. Second operand 6 states and 178 transitions. [2024-05-12 10:33:48,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 2478 flow [2024-05-12 10:33:48,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 177 transitions, 2388 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:48,108 INFO L231 Difference]: Finished difference. Result has 165 places, 146 transitions, 2045 flow [2024-05-12 10:33:48,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=165, PETRI_TRANSITIONS=146} [2024-05-12 10:33:48,109 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places. [2024-05-12 10:33:48,109 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 146 transitions, 2045 flow [2024-05-12 10:33:48,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:48,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:48,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:48,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 10:33:48,110 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:48,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1113338885, now seen corresponding path program 3 times [2024-05-12 10:33:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306243418] [2024-05-12 10:33:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:48,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:48,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306243418] [2024-05-12 10:33:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306243418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 10:33:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293929734] [2024-05-12 10:33:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:48,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:48,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:48,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:48,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 146 transitions, 2045 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:48,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:48,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:48,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:48,542 INFO L124 PetriNetUnfolderBase]: 1121/2379 cut-off events. [2024-05-12 10:33:48,542 INFO L125 PetriNetUnfolderBase]: For 39306/39460 co-relation queries the response was YES. [2024-05-12 10:33:48,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12412 conditions, 2379 events. 1121/2379 cut-off events. For 39306/39460 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16976 event pairs, 214 based on Foata normal form. 13/2299 useless extension candidates. Maximal degree in co-relation 12139. Up to 1012 conditions per place. [2024-05-12 10:33:48,560 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 93 selfloop transitions, 42 changer transitions 2/200 dead transitions. [2024-05-12 10:33:48,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 200 transitions, 2628 flow [2024-05-12 10:33:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 10:33:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 10:33:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2024-05-12 10:33:48,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-05-12 10:33:48,562 INFO L175 Difference]: Start difference. First operand has 165 places, 146 transitions, 2045 flow. Second operand 8 states and 232 transitions. [2024-05-12 10:33:48,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 200 transitions, 2628 flow [2024-05-12 10:33:48,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 200 transitions, 2562 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:48,656 INFO L231 Difference]: Finished difference. Result has 174 places, 161 transitions, 2252 flow [2024-05-12 10:33:48,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2252, PETRI_PLACES=174, PETRI_TRANSITIONS=161} [2024-05-12 10:33:48,657 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places. [2024-05-12 10:33:48,657 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 161 transitions, 2252 flow [2024-05-12 10:33:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:48,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:48,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 10:33:48,658 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:48,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 682402821, now seen corresponding path program 4 times [2024-05-12 10:33:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477307582] [2024-05-12 10:33:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477307582] [2024-05-12 10:33:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477307582] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035353893] [2024-05-12 10:33:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:48,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:48,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:48,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:48,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 161 transitions, 2252 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:48,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:48,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:49,111 INFO L124 PetriNetUnfolderBase]: 1000/2268 cut-off events. [2024-05-12 10:33:49,112 INFO L125 PetriNetUnfolderBase]: For 46070/46189 co-relation queries the response was YES. [2024-05-12 10:33:49,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12795 conditions, 2268 events. 1000/2268 cut-off events. For 46070/46189 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16653 event pairs, 284 based on Foata normal form. 10/2235 useless extension candidates. Maximal degree in co-relation 12096. Up to 910 conditions per place. [2024-05-12 10:33:49,131 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 97 selfloop transitions, 36 changer transitions 4/185 dead transitions. [2024-05-12 10:33:49,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 2636 flow [2024-05-12 10:33:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-05-12 10:33:49,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-05-12 10:33:49,132 INFO L175 Difference]: Start difference. First operand has 174 places, 161 transitions, 2252 flow. Second operand 6 states and 168 transitions. [2024-05-12 10:33:49,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 2636 flow [2024-05-12 10:33:49,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 2636 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 10:33:49,231 INFO L231 Difference]: Finished difference. Result has 181 places, 162 transitions, 2354 flow [2024-05-12 10:33:49,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2354, PETRI_PLACES=181, PETRI_TRANSITIONS=162} [2024-05-12 10:33:49,232 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 135 predicate places. [2024-05-12 10:33:49,232 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 162 transitions, 2354 flow [2024-05-12 10:33:49,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:49,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:49,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:49,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 10:33:49,233 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:49,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash -97733755, now seen corresponding path program 5 times [2024-05-12 10:33:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:49,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630415364] [2024-05-12 10:33:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630415364] [2024-05-12 10:33:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630415364] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:49,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:49,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 10:33:49,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890904543] [2024-05-12 10:33:49,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:49,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:49,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:49,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:49,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 10:33:49,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 162 transitions, 2354 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:49,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:49,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 10:33:49,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:49,643 INFO L124 PetriNetUnfolderBase]: 894/1947 cut-off events. [2024-05-12 10:33:49,644 INFO L125 PetriNetUnfolderBase]: For 26859/26910 co-relation queries the response was YES. [2024-05-12 10:33:49,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9873 conditions, 1947 events. 894/1947 cut-off events. For 26859/26910 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13256 event pairs, 191 based on Foata normal form. 59/1979 useless extension candidates. Maximal degree in co-relation 9113. Up to 397 conditions per place. [2024-05-12 10:33:49,656 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 77 selfloop transitions, 56 changer transitions 7/185 dead transitions. [2024-05-12 10:33:49,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 2534 flow [2024-05-12 10:33:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 10:33:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 10:33:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-05-12 10:33:49,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-05-12 10:33:49,658 INFO L175 Difference]: Start difference. First operand has 181 places, 162 transitions, 2354 flow. Second operand 10 states and 271 transitions. [2024-05-12 10:33:49,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 2534 flow [2024-05-12 10:33:49,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 2176 flow, removed 16 selfloop flow, removed 16 redundant places. [2024-05-12 10:33:49,724 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 1966 flow [2024-05-12 10:33:49,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1966, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2024-05-12 10:33:49,725 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-05-12 10:33:49,725 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 1966 flow [2024-05-12 10:33:49,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-05-12 10:33:49,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:49,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:49,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 10:33:49,726 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:49,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1744327733, now seen corresponding path program 1 times [2024-05-12 10:33:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473257030] [2024-05-12 10:33:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:49,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-05-12 10:33:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473257030] [2024-05-12 10:33:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473257030] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349399733] [2024-05-12 10:33:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:49,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:49,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:49,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 1966 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:49,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:49,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:49,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:50,126 INFO L124 PetriNetUnfolderBase]: 644/1505 cut-off events. [2024-05-12 10:33:50,126 INFO L125 PetriNetUnfolderBase]: For 26071/26138 co-relation queries the response was YES. [2024-05-12 10:33:50,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8454 conditions, 1505 events. 644/1505 cut-off events. For 26071/26138 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10381 event pairs, 156 based on Foata normal form. 5/1475 useless extension candidates. Maximal degree in co-relation 8134. Up to 480 conditions per place. [2024-05-12 10:33:50,139 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 78 selfloop transitions, 41 changer transitions 2/169 dead transitions. [2024-05-12 10:33:50,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 169 transitions, 2366 flow [2024-05-12 10:33:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-05-12 10:33:50,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-05-12 10:33:50,140 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 1966 flow. Second operand 6 states and 164 transitions. [2024-05-12 10:33:50,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 169 transitions, 2366 flow [2024-05-12 10:33:50,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 169 transitions, 2327 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 10:33:50,206 INFO L231 Difference]: Finished difference. Result has 179 places, 148 transitions, 2029 flow [2024-05-12 10:33:50,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2029, PETRI_PLACES=179, PETRI_TRANSITIONS=148} [2024-05-12 10:33:50,210 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2024-05-12 10:33:50,210 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 148 transitions, 2029 flow [2024-05-12 10:33:50,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:50,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:50,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:50,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 10:33:50,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:50,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash 962245191, now seen corresponding path program 2 times [2024-05-12 10:33:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749717378] [2024-05-12 10:33:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749717378] [2024-05-12 10:33:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749717378] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:50,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:50,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789971655] [2024-05-12 10:33:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:50,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:50,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:50,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:50,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:50,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 148 transitions, 2029 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:50,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:50,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:50,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:50,541 INFO L124 PetriNetUnfolderBase]: 657/1553 cut-off events. [2024-05-12 10:33:50,541 INFO L125 PetriNetUnfolderBase]: For 28410/28480 co-relation queries the response was YES. [2024-05-12 10:33:50,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8679 conditions, 1553 events. 657/1553 cut-off events. For 28410/28480 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10805 event pairs, 120 based on Foata normal form. 7/1529 useless extension candidates. Maximal degree in co-relation 8120. Up to 486 conditions per place. [2024-05-12 10:33:50,553 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 76 selfloop transitions, 42 changer transitions 3/169 dead transitions. [2024-05-12 10:33:50,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 169 transitions, 2479 flow [2024-05-12 10:33:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 10:33:50,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 10:33:50,556 INFO L175 Difference]: Start difference. First operand has 179 places, 148 transitions, 2029 flow. Second operand 6 states and 161 transitions. [2024-05-12 10:33:50,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 169 transitions, 2479 flow [2024-05-12 10:33:50,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 169 transitions, 2415 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:50,624 INFO L231 Difference]: Finished difference. Result has 182 places, 149 transitions, 2071 flow [2024-05-12 10:33:50,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2071, PETRI_PLACES=182, PETRI_TRANSITIONS=149} [2024-05-12 10:33:50,626 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-05-12 10:33:50,626 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 149 transitions, 2071 flow [2024-05-12 10:33:50,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:50,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:50,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 10:33:50,627 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:50,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 962184741, now seen corresponding path program 3 times [2024-05-12 10:33:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899837189] [2024-05-12 10:33:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899837189] [2024-05-12 10:33:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899837189] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065355448] [2024-05-12 10:33:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:50,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:50,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:50,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 149 transitions, 2071 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:50,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:50,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:50,997 INFO L124 PetriNetUnfolderBase]: 654/1548 cut-off events. [2024-05-12 10:33:50,997 INFO L125 PetriNetUnfolderBase]: For 29518/29588 co-relation queries the response was YES. [2024-05-12 10:33:51,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8681 conditions, 1548 events. 654/1548 cut-off events. For 29518/29588 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10764 event pairs, 120 based on Foata normal form. 7/1524 useless extension candidates. Maximal degree in co-relation 8119. Up to 484 conditions per place. [2024-05-12 10:33:51,009 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 73 selfloop transitions, 45 changer transitions 3/169 dead transitions. [2024-05-12 10:33:51,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 169 transitions, 2509 flow [2024-05-12 10:33:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 10:33:51,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 10:33:51,010 INFO L175 Difference]: Start difference. First operand has 182 places, 149 transitions, 2071 flow. Second operand 6 states and 161 transitions. [2024-05-12 10:33:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 169 transitions, 2509 flow [2024-05-12 10:33:51,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 169 transitions, 2402 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:51,072 INFO L231 Difference]: Finished difference. Result has 184 places, 149 transitions, 2058 flow [2024-05-12 10:33:51,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2058, PETRI_PLACES=184, PETRI_TRANSITIONS=149} [2024-05-12 10:33:51,073 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2024-05-12 10:33:51,073 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 149 transitions, 2058 flow [2024-05-12 10:33:51,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 10:33:51,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:51,073 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-05-12 10:33:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 10:33:51,074 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:51,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1868522233, now seen corresponding path program 1 times [2024-05-12 10:33:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121183994] [2024-05-12 10:33:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121183994] [2024-05-12 10:33:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121183994] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495279105] [2024-05-12 10:33:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:51,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:51,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:51,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:51,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 149 transitions, 2058 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:51,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:51,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:51,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:51,463 INFO L124 PetriNetUnfolderBase]: 692/1675 cut-off events. [2024-05-12 10:33:51,464 INFO L125 PetriNetUnfolderBase]: For 30548/30601 co-relation queries the response was YES. [2024-05-12 10:33:51,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 1675 events. 692/1675 cut-off events. For 30548/30601 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12012 event pairs, 90 based on Foata normal form. 14/1673 useless extension candidates. Maximal degree in co-relation 8450. Up to 414 conditions per place. [2024-05-12 10:33:51,499 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 88 selfloop transitions, 25 changer transitions 6/167 dead transitions. [2024-05-12 10:33:51,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 2438 flow [2024-05-12 10:33:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-05-12 10:33:51,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-05-12 10:33:51,501 INFO L175 Difference]: Start difference. First operand has 184 places, 149 transitions, 2058 flow. Second operand 6 states and 158 transitions. [2024-05-12 10:33:51,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 2438 flow [2024-05-12 10:33:51,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 167 transitions, 2321 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:33:51,572 INFO L231 Difference]: Finished difference. Result has 184 places, 145 transitions, 1919 flow [2024-05-12 10:33:51,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1919, PETRI_PLACES=184, PETRI_TRANSITIONS=145} [2024-05-12 10:33:51,573 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 138 predicate places. [2024-05-12 10:33:51,573 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 145 transitions, 1919 flow [2024-05-12 10:33:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:51,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:51,573 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-05-12 10:33:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 10:33:51,573 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:51,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2003600341, now seen corresponding path program 2 times [2024-05-12 10:33:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851822451] [2024-05-12 10:33:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851822451] [2024-05-12 10:33:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851822451] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286104854] [2024-05-12 10:33:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:51,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:51,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:51,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 145 transitions, 1919 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:51,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:51,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:51,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:51,887 INFO L124 PetriNetUnfolderBase]: 638/1541 cut-off events. [2024-05-12 10:33:51,887 INFO L125 PetriNetUnfolderBase]: For 29308/29363 co-relation queries the response was YES. [2024-05-12 10:33:51,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1541 events. 638/1541 cut-off events. For 29308/29363 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10869 event pairs, 71 based on Foata normal form. 14/1530 useless extension candidates. Maximal degree in co-relation 7693. Up to 380 conditions per place. [2024-05-12 10:33:51,902 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 87 selfloop transitions, 24 changer transitions 0/159 dead transitions. [2024-05-12 10:33:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 159 transitions, 2277 flow [2024-05-12 10:33:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 10:33:51,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-05-12 10:33:51,904 INFO L175 Difference]: Start difference. First operand has 184 places, 145 transitions, 1919 flow. Second operand 6 states and 154 transitions. [2024-05-12 10:33:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 159 transitions, 2277 flow [2024-05-12 10:33:51,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 159 transitions, 2202 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-05-12 10:33:51,971 INFO L231 Difference]: Finished difference. Result has 180 places, 145 transitions, 1905 flow [2024-05-12 10:33:51,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1905, PETRI_PLACES=180, PETRI_TRANSITIONS=145} [2024-05-12 10:33:51,972 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 134 predicate places. [2024-05-12 10:33:51,972 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 145 transitions, 1905 flow [2024-05-12 10:33:51,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:51,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:51,972 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-05-12 10:33:51,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 10:33:51,973 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:51,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1702480251, now seen corresponding path program 3 times [2024-05-12 10:33:51,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627720681] [2024-05-12 10:33:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:52,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627720681] [2024-05-12 10:33:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627720681] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:52,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:52,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948502246] [2024-05-12 10:33:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:52,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:52,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:52,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 145 transitions, 1905 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:52,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:52,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:52,271 INFO L124 PetriNetUnfolderBase]: 624/1507 cut-off events. [2024-05-12 10:33:52,271 INFO L125 PetriNetUnfolderBase]: For 26912/26961 co-relation queries the response was YES. [2024-05-12 10:33:52,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7963 conditions, 1507 events. 624/1507 cut-off events. For 26912/26961 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10531 event pairs, 70 based on Foata normal form. 14/1497 useless extension candidates. Maximal degree in co-relation 7385. Up to 375 conditions per place. [2024-05-12 10:33:52,280 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 64 selfloop transitions, 47 changer transitions 0/159 dead transitions. [2024-05-12 10:33:52,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 159 transitions, 2207 flow [2024-05-12 10:33:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 10:33:52,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 10:33:52,281 INFO L175 Difference]: Start difference. First operand has 180 places, 145 transitions, 1905 flow. Second operand 6 states and 157 transitions. [2024-05-12 10:33:52,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 159 transitions, 2207 flow [2024-05-12 10:33:52,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 159 transitions, 2100 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-05-12 10:33:52,341 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 1901 flow [2024-05-12 10:33:52,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1901, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2024-05-12 10:33:52,341 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places. [2024-05-12 10:33:52,341 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 1901 flow [2024-05-12 10:33:52,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:52,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:52,342 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-05-12 10:33:52,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 10:33:52,342 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:52,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2068029930, now seen corresponding path program 1 times [2024-05-12 10:33:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645990712] [2024-05-12 10:33:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645990712] [2024-05-12 10:33:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645990712] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200363825] [2024-05-12 10:33:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:52,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:52,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:52,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 145 transitions, 1901 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:52,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:52,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:52,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:52,681 INFO L124 PetriNetUnfolderBase]: 644/1568 cut-off events. [2024-05-12 10:33:52,681 INFO L125 PetriNetUnfolderBase]: For 26609/26652 co-relation queries the response was YES. [2024-05-12 10:33:52,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 1568 events. 644/1568 cut-off events. For 26609/26652 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11220 event pairs, 136 based on Foata normal form. 20/1572 useless extension candidates. Maximal degree in co-relation 7900. Up to 329 conditions per place. [2024-05-12 10:33:52,691 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 62 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-05-12 10:33:52,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 165 transitions, 2257 flow [2024-05-12 10:33:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 10:33:52,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-05-12 10:33:52,692 INFO L175 Difference]: Start difference. First operand has 178 places, 145 transitions, 1901 flow. Second operand 6 states and 161 transitions. [2024-05-12 10:33:52,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 165 transitions, 2257 flow [2024-05-12 10:33:52,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 165 transitions, 2162 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 10:33:52,752 INFO L231 Difference]: Finished difference. Result has 179 places, 146 transitions, 1949 flow [2024-05-12 10:33:52,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1949, PETRI_PLACES=179, PETRI_TRANSITIONS=146} [2024-05-12 10:33:52,753 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places. [2024-05-12 10:33:52,753 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 146 transitions, 1949 flow [2024-05-12 10:33:52,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:52,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:52,753 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-05-12 10:33:52,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 10:33:52,754 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:52,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2058924984, now seen corresponding path program 2 times [2024-05-12 10:33:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741040491] [2024-05-12 10:33:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:52,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:52,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741040491] [2024-05-12 10:33:52,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741040491] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:52,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863769575] [2024-05-12 10:33:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:52,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:52,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:52,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 146 transitions, 1949 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:52,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:52,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:52,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:53,080 INFO L124 PetriNetUnfolderBase]: 671/1651 cut-off events. [2024-05-12 10:33:53,080 INFO L125 PetriNetUnfolderBase]: For 29204/29250 co-relation queries the response was YES. [2024-05-12 10:33:53,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8593 conditions, 1651 events. 671/1651 cut-off events. For 29204/29250 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12028 event pairs, 136 based on Foata normal form. 14/1644 useless extension candidates. Maximal degree in co-relation 8334. Up to 499 conditions per place. [2024-05-12 10:33:53,091 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 90 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-05-12 10:33:53,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 165 transitions, 2365 flow [2024-05-12 10:33:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 10:33:53,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 10:33:53,093 INFO L175 Difference]: Start difference. First operand has 179 places, 146 transitions, 1949 flow. Second operand 6 states and 157 transitions. [2024-05-12 10:33:53,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 165 transitions, 2365 flow [2024-05-12 10:33:53,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 165 transitions, 2252 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:53,168 INFO L231 Difference]: Finished difference. Result has 182 places, 148 transitions, 1940 flow [2024-05-12 10:33:53,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=182, PETRI_TRANSITIONS=148} [2024-05-12 10:33:53,169 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-05-12 10:33:53,169 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 148 transitions, 1940 flow [2024-05-12 10:33:53,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:53,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:53,170 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-05-12 10:33:53,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 10:33:53,170 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:53,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1358213680, now seen corresponding path program 3 times [2024-05-12 10:33:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240480748] [2024-05-12 10:33:53,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240480748] [2024-05-12 10:33:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240480748] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:53,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907205265] [2024-05-12 10:33:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:53,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:53,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:53,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:53,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 148 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:53,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:53,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:53,550 INFO L124 PetriNetUnfolderBase]: 665/1631 cut-off events. [2024-05-12 10:33:53,551 INFO L125 PetriNetUnfolderBase]: For 26132/26181 co-relation queries the response was YES. [2024-05-12 10:33:53,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8398 conditions, 1631 events. 665/1631 cut-off events. For 26132/26181 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11869 event pairs, 138 based on Foata normal form. 8/1618 useless extension candidates. Maximal degree in co-relation 8140. Up to 497 conditions per place. [2024-05-12 10:33:53,561 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 82 selfloop transitions, 33 changer transitions 0/163 dead transitions. [2024-05-12 10:33:53,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 163 transitions, 2260 flow [2024-05-12 10:33:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-05-12 10:33:53,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2024-05-12 10:33:53,563 INFO L175 Difference]: Start difference. First operand has 182 places, 148 transitions, 1940 flow. Second operand 6 states and 154 transitions. [2024-05-12 10:33:53,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 163 transitions, 2260 flow [2024-05-12 10:33:53,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 163 transitions, 2204 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 10:33:53,635 INFO L231 Difference]: Finished difference. Result has 185 places, 148 transitions, 1954 flow [2024-05-12 10:33:53,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1954, PETRI_PLACES=185, PETRI_TRANSITIONS=148} [2024-05-12 10:33:53,636 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 139 predicate places. [2024-05-12 10:33:53,636 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 148 transitions, 1954 flow [2024-05-12 10:33:53,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:53,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:53,637 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-05-12 10:33:53,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 10:33:53,637 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:53,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -62678280, now seen corresponding path program 4 times [2024-05-12 10:33:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799526155] [2024-05-12 10:33:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799526155] [2024-05-12 10:33:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799526155] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:53,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892882912] [2024-05-12 10:33:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:53,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:53,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 148 transitions, 1954 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:53,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:53,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:53,983 INFO L124 PetriNetUnfolderBase]: 682/1690 cut-off events. [2024-05-12 10:33:53,984 INFO L125 PetriNetUnfolderBase]: For 27636/27693 co-relation queries the response was YES. [2024-05-12 10:33:53,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8660 conditions, 1690 events. 682/1690 cut-off events. For 27636/27693 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12454 event pairs, 195 based on Foata normal form. 14/1675 useless extension candidates. Maximal degree in co-relation 8079. Up to 576 conditions per place. [2024-05-12 10:33:53,995 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 98 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2024-05-12 10:33:53,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 165 transitions, 2414 flow [2024-05-12 10:33:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-05-12 10:33:53,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.549645390070922 [2024-05-12 10:33:53,997 INFO L175 Difference]: Start difference. First operand has 185 places, 148 transitions, 1954 flow. Second operand 6 states and 155 transitions. [2024-05-12 10:33:53,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 165 transitions, 2414 flow [2024-05-12 10:33:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 165 transitions, 2344 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 10:33:54,078 INFO L231 Difference]: Finished difference. Result has 186 places, 149 transitions, 1940 flow [2024-05-12 10:33:54,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=186, PETRI_TRANSITIONS=149} [2024-05-12 10:33:54,078 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 140 predicate places. [2024-05-12 10:33:54,078 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 149 transitions, 1940 flow [2024-05-12 10:33:54,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:54,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:54,079 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-05-12 10:33:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 10:33:54,079 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:54,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -62443920, now seen corresponding path program 5 times [2024-05-12 10:33:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287857025] [2024-05-12 10:33:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287857025] [2024-05-12 10:33:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287857025] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754627034] [2024-05-12 10:33:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:54,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:54,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:54,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 149 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:54,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:54,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:54,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:54,409 INFO L124 PetriNetUnfolderBase]: 668/1656 cut-off events. [2024-05-12 10:33:54,409 INFO L125 PetriNetUnfolderBase]: For 27048/27084 co-relation queries the response was YES. [2024-05-12 10:33:54,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 1656 events. 668/1656 cut-off events. For 27048/27084 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12097 event pairs, 186 based on Foata normal form. 14/1642 useless extension candidates. Maximal degree in co-relation 7689. Up to 572 conditions per place. [2024-05-12 10:33:54,420 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 95 selfloop transitions, 20 changer transitions 1/164 dead transitions. [2024-05-12 10:33:54,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 164 transitions, 2326 flow [2024-05-12 10:33:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-05-12 10:33:54,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2024-05-12 10:33:54,421 INFO L175 Difference]: Start difference. First operand has 186 places, 149 transitions, 1940 flow. Second operand 6 states and 153 transitions. [2024-05-12 10:33:54,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 164 transitions, 2326 flow [2024-05-12 10:33:54,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 164 transitions, 2256 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-05-12 10:33:54,493 INFO L231 Difference]: Finished difference. Result has 187 places, 149 transitions, 1916 flow [2024-05-12 10:33:54,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1916, PETRI_PLACES=187, PETRI_TRANSITIONS=149} [2024-05-12 10:33:54,493 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2024-05-12 10:33:54,494 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 149 transitions, 1916 flow [2024-05-12 10:33:54,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:54,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:54,494 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-05-12 10:33:54,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 10:33:54,494 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:54,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -237042120, now seen corresponding path program 6 times [2024-05-12 10:33:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714489080] [2024-05-12 10:33:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714489080] [2024-05-12 10:33:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714489080] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:54,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:54,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213612221] [2024-05-12 10:33:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:54,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:54,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:54,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:54,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 149 transitions, 1916 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:54,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:54,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:54,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:54,828 INFO L124 PetriNetUnfolderBase]: 665/1651 cut-off events. [2024-05-12 10:33:54,828 INFO L125 PetriNetUnfolderBase]: For 23297/23333 co-relation queries the response was YES. [2024-05-12 10:33:54,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 1651 events. 665/1651 cut-off events. For 23297/23333 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12049 event pairs, 185 based on Foata normal form. 8/1633 useless extension candidates. Maximal degree in co-relation 7531. Up to 570 conditions per place. [2024-05-12 10:33:54,838 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 84 selfloop transitions, 31 changer transitions 1/164 dead transitions. [2024-05-12 10:33:54,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 164 transitions, 2306 flow [2024-05-12 10:33:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-05-12 10:33:54,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-05-12 10:33:54,840 INFO L175 Difference]: Start difference. First operand has 187 places, 149 transitions, 1916 flow. Second operand 6 states and 152 transitions. [2024-05-12 10:33:54,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 164 transitions, 2306 flow [2024-05-12 10:33:54,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 164 transitions, 2272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 10:33:54,907 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1948 flow [2024-05-12 10:33:54,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1948, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-05-12 10:33:54,909 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 143 predicate places. [2024-05-12 10:33:54,909 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1948 flow [2024-05-12 10:33:54,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-05-12 10:33:54,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:54,909 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, 1, 1] [2024-05-12 10:33:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 10:33:54,910 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:54,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash 637143496, now seen corresponding path program 1 times [2024-05-12 10:33:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113729115] [2024-05-12 10:33:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:55,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113729115] [2024-05-12 10:33:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113729115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:55,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:55,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480239770] [2024-05-12 10:33:55,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:55,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:55,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:55,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:55,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1948 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:55,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:55,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:55,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:55,275 INFO L124 PetriNetUnfolderBase]: 650/1620 cut-off events. [2024-05-12 10:33:55,275 INFO L125 PetriNetUnfolderBase]: For 23188/23218 co-relation queries the response was YES. [2024-05-12 10:33:55,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 1620 events. 650/1620 cut-off events. For 23188/23218 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11816 event pairs, 201 based on Foata normal form. 2/1596 useless extension candidates. Maximal degree in co-relation 7432. Up to 494 conditions per place. [2024-05-12 10:33:55,288 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 57 selfloop transitions, 58 changer transitions 1/164 dead transitions. [2024-05-12 10:33:55,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 164 transitions, 2284 flow [2024-05-12 10:33:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-05-12 10:33:55,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567375886524822 [2024-05-12 10:33:55,289 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1948 flow. Second operand 6 states and 157 transitions. [2024-05-12 10:33:55,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 164 transitions, 2284 flow [2024-05-12 10:33:55,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 164 transitions, 2209 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:33:55,368 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1993 flow [2024-05-12 10:33:55,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1993, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-05-12 10:33:55,369 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 143 predicate places. [2024-05-12 10:33:55,369 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1993 flow [2024-05-12 10:33:55,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:55,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:55,370 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, 1, 1] [2024-05-12 10:33:55,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 10:33:55,370 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:55,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1357489876, now seen corresponding path program 2 times [2024-05-12 10:33:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710034606] [2024-05-12 10:33:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710034606] [2024-05-12 10:33:55,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710034606] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:55,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249702713] [2024-05-12 10:33:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:55,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:55,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:55,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1993 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:55,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:55,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:55,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:55,933 INFO L124 PetriNetUnfolderBase]: 655/1628 cut-off events. [2024-05-12 10:33:55,933 INFO L125 PetriNetUnfolderBase]: For 23482/23509 co-relation queries the response was YES. [2024-05-12 10:33:55,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 1628 events. 655/1628 cut-off events. For 23482/23509 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11945 event pairs, 207 based on Foata normal form. 2/1604 useless extension candidates. Maximal degree in co-relation 7518. Up to 488 conditions per place. [2024-05-12 10:33:55,945 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 74 selfloop transitions, 27 changer transitions 12/161 dead transitions. [2024-05-12 10:33:55,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 161 transitions, 2247 flow [2024-05-12 10:33:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 10:33:55,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354609929078015 [2024-05-12 10:33:55,946 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1993 flow. Second operand 6 states and 151 transitions. [2024-05-12 10:33:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 161 transitions, 2247 flow [2024-05-12 10:33:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 161 transitions, 2066 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 10:33:56,017 INFO L231 Difference]: Finished difference. Result has 187 places, 143 transitions, 1792 flow [2024-05-12 10:33:56,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1792, PETRI_PLACES=187, PETRI_TRANSITIONS=143} [2024-05-12 10:33:56,018 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 141 predicate places. [2024-05-12 10:33:56,018 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 143 transitions, 1792 flow [2024-05-12 10:33:56,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:56,018 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, 1, 1] [2024-05-12 10:33:56,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 10:33:56,019 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:56,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 455173286, now seen corresponding path program 1 times [2024-05-12 10:33:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221060893] [2024-05-12 10:33:56,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:56,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221060893] [2024-05-12 10:33:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221060893] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789349666] [2024-05-12 10:33:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:56,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:56,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:56,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:56,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:56,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 143 transitions, 1792 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:56,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:56,359 INFO L124 PetriNetUnfolderBase]: 609/1549 cut-off events. [2024-05-12 10:33:56,359 INFO L125 PetriNetUnfolderBase]: For 20156/20190 co-relation queries the response was YES. [2024-05-12 10:33:56,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1549 events. 609/1549 cut-off events. For 20156/20190 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11291 event pairs, 92 based on Foata normal form. 4/1538 useless extension candidates. Maximal degree in co-relation 7085. Up to 239 conditions per place. [2024-05-12 10:33:56,371 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 56 selfloop transitions, 59 changer transitions 1/164 dead transitions. [2024-05-12 10:33:56,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 164 transitions, 2140 flow [2024-05-12 10:33:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-05-12 10:33:56,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5780141843971631 [2024-05-12 10:33:56,372 INFO L175 Difference]: Start difference. First operand has 187 places, 143 transitions, 1792 flow. Second operand 6 states and 163 transitions. [2024-05-12 10:33:56,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 164 transitions, 2140 flow [2024-05-12 10:33:56,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 164 transitions, 2055 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-05-12 10:33:56,439 INFO L231 Difference]: Finished difference. Result has 178 places, 143 transitions, 1839 flow [2024-05-12 10:33:56,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1839, PETRI_PLACES=178, PETRI_TRANSITIONS=143} [2024-05-12 10:33:56,440 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 132 predicate places. [2024-05-12 10:33:56,440 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 143 transitions, 1839 flow [2024-05-12 10:33:56,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:56,441 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, 1, 1] [2024-05-12 10:33:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 10:33:56,441 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:56,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1033701822, now seen corresponding path program 2 times [2024-05-12 10:33:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933868983] [2024-05-12 10:33:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933868983] [2024-05-12 10:33:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933868983] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:56,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:56,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088474627] [2024-05-12 10:33:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:56,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:56,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:56,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:56,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 143 transitions, 1839 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:56,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:56,781 INFO L124 PetriNetUnfolderBase]: 616/1565 cut-off events. [2024-05-12 10:33:56,781 INFO L125 PetriNetUnfolderBase]: For 19875/19909 co-relation queries the response was YES. [2024-05-12 10:33:56,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 1565 events. 616/1565 cut-off events. For 19875/19909 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11458 event pairs, 99 based on Foata normal form. 4/1554 useless extension candidates. Maximal degree in co-relation 7278. Up to 374 conditions per place. [2024-05-12 10:33:56,790 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 74 selfloop transitions, 26 changer transitions 13/161 dead transitions. [2024-05-12 10:33:56,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 161 transitions, 2183 flow [2024-05-12 10:33:56,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-05-12 10:33:56,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 10:33:56,791 INFO L175 Difference]: Start difference. First operand has 178 places, 143 transitions, 1839 flow. Second operand 6 states and 156 transitions. [2024-05-12 10:33:56,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 161 transitions, 2183 flow [2024-05-12 10:33:56,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 161 transitions, 2022 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 10:33:56,851 INFO L231 Difference]: Finished difference. Result has 177 places, 137 transitions, 1667 flow [2024-05-12 10:33:56,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1667, PETRI_PLACES=177, PETRI_TRANSITIONS=137} [2024-05-12 10:33:56,852 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-05-12 10:33:56,852 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 137 transitions, 1667 flow [2024-05-12 10:33:56,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:56,852 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, 1, 1] [2024-05-12 10:33:56,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 10:33:56,853 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:56,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1323504042, now seen corresponding path program 3 times [2024-05-12 10:33:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101361879] [2024-05-12 10:33:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101361879] [2024-05-12 10:33:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101361879] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034798099] [2024-05-12 10:33:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:56,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:56,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 137 transitions, 1667 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:56,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:56,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:56,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:57,171 INFO L124 PetriNetUnfolderBase]: 545/1384 cut-off events. [2024-05-12 10:33:57,171 INFO L125 PetriNetUnfolderBase]: For 15966/15996 co-relation queries the response was YES. [2024-05-12 10:33:57,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 1384 events. 545/1384 cut-off events. For 15966/15996 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9914 event pairs, 119 based on Foata normal form. 4/1370 useless extension candidates. Maximal degree in co-relation 6185. Up to 395 conditions per place. [2024-05-12 10:33:57,180 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 79 selfloop transitions, 22 changer transitions 9/158 dead transitions. [2024-05-12 10:33:57,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 158 transitions, 1935 flow [2024-05-12 10:33:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-05-12 10:33:57,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673758865248227 [2024-05-12 10:33:57,182 INFO L175 Difference]: Start difference. First operand has 177 places, 137 transitions, 1667 flow. Second operand 6 states and 160 transitions. [2024-05-12 10:33:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 158 transitions, 1935 flow [2024-05-12 10:33:57,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 158 transitions, 1869 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-05-12 10:33:57,228 INFO L231 Difference]: Finished difference. Result has 169 places, 132 transitions, 1589 flow [2024-05-12 10:33:57,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=169, PETRI_TRANSITIONS=132} [2024-05-12 10:33:57,228 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places. [2024-05-12 10:33:57,229 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 132 transitions, 1589 flow [2024-05-12 10:33:57,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-05-12 10:33:57,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:57,229 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, 1, 1, 1, 1] [2024-05-12 10:33:57,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 10:33:57,229 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:57,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -28033144, now seen corresponding path program 1 times [2024-05-12 10:33:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521186421] [2024-05-12 10:33:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:57,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521186421] [2024-05-12 10:33:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521186421] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:57,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955233129] [2024-05-12 10:33:57,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:57,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:57,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:57,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 132 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-05-12 10:33:57,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:57,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:57,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:57,502 INFO L124 PetriNetUnfolderBase]: 504/1279 cut-off events. [2024-05-12 10:33:57,502 INFO L125 PetriNetUnfolderBase]: For 12274/12305 co-relation queries the response was YES. [2024-05-12 10:33:57,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 1279 events. 504/1279 cut-off events. For 12274/12305 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9049 event pairs, 42 based on Foata normal form. 4/1268 useless extension candidates. Maximal degree in co-relation 5673. Up to 372 conditions per place. [2024-05-12 10:33:57,510 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 44 selfloop transitions, 18 changer transitions 58/151 dead transitions. [2024-05-12 10:33:57,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 151 transitions, 1837 flow [2024-05-12 10:33:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-05-12 10:33:57,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2024-05-12 10:33:57,511 INFO L175 Difference]: Start difference. First operand has 169 places, 132 transitions, 1589 flow. Second operand 6 states and 159 transitions. [2024-05-12 10:33:57,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 151 transitions, 1837 flow [2024-05-12 10:33:57,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1759 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-05-12 10:33:57,550 INFO L231 Difference]: Finished difference. Result has 159 places, 85 transitions, 916 flow [2024-05-12 10:33:57,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=159, PETRI_TRANSITIONS=85} [2024-05-12 10:33:57,550 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-05-12 10:33:57,550 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 85 transitions, 916 flow [2024-05-12 10:33:57,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-05-12 10:33:57,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:33:57,551 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, 1, 1, 1, 1] [2024-05-12 10:33:57,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 10:33:57,551 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-05-12 10:33:57,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:33:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1810059764, now seen corresponding path program 2 times [2024-05-12 10:33:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:33:57,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222760166] [2024-05-12 10:33:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:33:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:33:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:33:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:33:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:33:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222760166] [2024-05-12 10:33:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222760166] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:33:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:33:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 10:33:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522552431] [2024-05-12 10:33:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:33:57,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 10:33:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:33:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 10:33:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 10:33:57,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-05-12 10:33:57,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 85 transitions, 916 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-05-12 10:33:57,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:33:57,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-05-12 10:33:57,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:33:57,844 INFO L124 PetriNetUnfolderBase]: 289/748 cut-off events. [2024-05-12 10:33:57,844 INFO L125 PetriNetUnfolderBase]: For 6442/6469 co-relation queries the response was YES. [2024-05-12 10:33:57,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 748 events. 289/748 cut-off events. For 6442/6469 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4606 event pairs, 38 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 3159. Up to 132 conditions per place. [2024-05-12 10:33:57,849 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2024-05-12 10:33:57,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 95 transitions, 1014 flow [2024-05-12 10:33:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 10:33:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 10:33:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 10:33:57,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 10:33:57,854 INFO L175 Difference]: Start difference. First operand has 159 places, 85 transitions, 916 flow. Second operand 6 states and 141 transitions. [2024-05-12 10:33:57,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 95 transitions, 1014 flow [2024-05-12 10:33:57,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 731 flow, removed 11 selfloop flow, removed 46 redundant places. [2024-05-12 10:33:57,866 INFO L231 Difference]: Finished difference. Result has 102 places, 0 transitions, 0 flow [2024-05-12 10:33:57,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=102, PETRI_TRANSITIONS=0} [2024-05-12 10:33:57,867 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2024-05-12 10:33:57,867 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 0 transitions, 0 flow [2024-05-12 10:33:57,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-05-12 10:33:57,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-05-12 10:33:57,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-12 10:33:57,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-05-12 10:33:57,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-05-12 10:33:57,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-05-12 10:33:57,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-05-12 10:33:57,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-12 10:33:57,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-12 10:33:57,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 10:33:57,872 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:33:57,876 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 10:33:57,876 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 10:33:57,879 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 10:33:57,879 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 10:33:57,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 10:33:57 BasicIcfg [2024-05-12 10:33:57,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 10:33:57,880 INFO L158 Benchmark]: Toolchain (without parser) took 20556.78ms. Allocated memory was 146.8MB in the beginning and 994.1MB in the end (delta: 847.2MB). Free memory was 114.3MB in the beginning and 876.2MB in the end (delta: -761.9MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,881 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:33:57,881 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 121.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 10:33:57,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.11ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 88.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 146.8MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,881 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,882 INFO L158 Benchmark]: RCFGBuilder took 389.02ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 57.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,882 INFO L158 Benchmark]: TraceAbstraction took 19605.34ms. Allocated memory was 146.8MB in the beginning and 994.1MB in the end (delta: 847.2MB). Free memory was 56.7MB in the beginning and 876.2MB in the end (delta: -819.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-05-12 10:33:57,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.92ms. Allocated memory is still 121.6MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.11ms. Allocated memory is still 146.8MB. Free memory was 114.3MB in the beginning and 88.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.63ms. Allocated memory is still 146.8MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.02ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 57.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19605.34ms. Allocated memory was 146.8MB in the beginning and 994.1MB in the end (delta: 847.2MB). Free memory was 56.7MB in the beginning and 876.2MB in the end (delta: -819.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 753]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 725]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 762]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 763]: 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, 74 locations, 8 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: 19.5s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4278 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3101 mSDsluCounter, 1751 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1274 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7167 IncrementalHoareTripleChecker+Invalid, 7465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 477 mSDtfsCounter, 7167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2354occurred in iteration=26, InterpolantAutomatonStates: 278, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 3210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-12 10:33:57,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE