./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi005.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/rfi005.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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-wmm/rfi005.i ./goblint.2024-05-21_14-57-05.files/protection/rfi005.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:26:45,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:26:45,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:26:45,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:26:45,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:26:45,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:26:45,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:26:45,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:26:45,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:26:45,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:26:45,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:26:45,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:26:45,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:26:45,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:26:45,488 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:26:45,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:26:45,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:26:45,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:26:45,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:26:45,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:26:45,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:26:45,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:26:45,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:26:45,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:26:45,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:26:45,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:26:45,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:26:45,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:26:45,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:26:45,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:26:45,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:26:45,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:26:45,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:26:45,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:26:45,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:26:45,494 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:26:45,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:26:45,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:26:45,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 15:26:45,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:26:45,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:26:45,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:26:45,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:26:45,709 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:26:45,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-04 15:26:46,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:26:46,903 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:26:46,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-04 15:26:46,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d4e462d/642d5caf18c24ac28600ea747c761062/FLAG24c70f155 [2024-06-04 15:26:46,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d4e462d/642d5caf18c24ac28600ea747c761062 [2024-06-04 15:26:46,929 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:26:46,930 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:26:46,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/rfi005.yml/witness.yml [2024-06-04 15:26:47,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:26:47,029 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:26:47,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:26:47,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:26:47,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:26:47,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:26:46" (1/2) ... [2024-06-04 15:26:47,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e9da3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:26:47, skipping insertion in model container [2024-06-04 15:26:47,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:26:46" (1/2) ... [2024-06-04 15:26:47,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61e52efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:26:47, skipping insertion in model container [2024-06-04 15:26:47,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:26:47" (2/2) ... [2024-06-04 15:26:47,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e9da3d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47, skipping insertion in model container [2024-06-04 15:26:47,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:26:47" (2/2) ... [2024-06-04 15:26:47,037 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:26:47,084 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:26:47,085 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] (((((((((((((((! multithreaded || y$r_buff0_thd0 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y$mem_tmp && y$mem_tmp <= 2) && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) [2024-06-04 15:26:47,086 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] (((((((((((((((! multithreaded || y$r_buff0_thd0 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y$mem_tmp && y$mem_tmp <= 2) && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) [2024-06-04 15:26:47,086 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:26:47,086 INFO L106 edCorrectnessWitness]: ghost_update [L835-L835] multithreaded = 1; [2024-06-04 15:26:47,124 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:26:47,456 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:26:47,466 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:26:47,592 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:26:47,632 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:26:47,633 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47 WrapperNode [2024-06-04 15:26:47,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:26:47,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:26:47,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:26:47,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:26:47,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,710 INFO L138 Inliner]: procedures = 174, calls = 41, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 174 [2024-06-04 15:26:47,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:26:47,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:26:47,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:26:47,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:26:47,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,739 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 15:26:47,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:26:47,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:26:47,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:26:47,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:26:47,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (1/1) ... [2024-06-04 15:26:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:26:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:26:47,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 15:26:47,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 15:26:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:26:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:26:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:26:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:26:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:26:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:26:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:26:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:26:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:26:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:26:47,820 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:26:47,918 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:26:47,920 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:26:48,210 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:26:48,210 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:26:48,362 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:26:48,362 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:26:48,364 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:26:48 BoogieIcfgContainer [2024-06-04 15:26:48,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:26:48,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:26:48,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:26:48,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:26:48,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:26:46" (1/4) ... [2024-06-04 15:26:48,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636bc8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:26:48, skipping insertion in model container [2024-06-04 15:26:48,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:26:47" (2/4) ... [2024-06-04 15:26:48,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636bc8ca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:26:48, skipping insertion in model container [2024-06-04 15:26:48,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:26:47" (3/4) ... [2024-06-04 15:26:48,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636bc8ca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:26:48, skipping insertion in model container [2024-06-04 15:26:48,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:26:48" (4/4) ... [2024-06-04 15:26:48,375 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi005.i [2024-06-04 15:26:48,388 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:26:48,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 15:26:48,389 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:26:48,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:26:48,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 15:26:48,477 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-04 15:26:48,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:26:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:26:48,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 15:26:48,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-04 15:26:48,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:26:48,498 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;@2f916983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:26:48,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 15:26:48,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:26:48,503 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:26:48,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:26:48,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:48,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:26:48,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:48,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash 865260380, now seen corresponding path program 1 times [2024-06-04 15:26:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135179574] [2024-06-04 15:26:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135179574] [2024-06-04 15:26:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135179574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 15:26:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272834484] [2024-06-04 15:26:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:49,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 15:26:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 15:26:49,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 15:26:49,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-04 15:26:49,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:49,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:49,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-04 15:26:49,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:49,602 INFO L124 PetriNetUnfolderBase]: 153/306 cut-off events. [2024-06-04 15:26:49,603 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 15:26:49,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 306 events. 153/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1219 event pairs, 89 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 587. Up to 272 conditions per place. [2024-06-04 15:26:49,606 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-04 15:26:49,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-04 15:26:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 15:26:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 15:26:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-04 15:26:49,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-04 15:26:49,616 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 55 transitions. [2024-06-04 15:26:49,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-04 15:26:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:26:49,619 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-04 15:26:49,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-04 15:26:49,623 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-04 15:26:49,623 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-04 15:26:49,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:49,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:49,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:26:49,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:49,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1708396933, now seen corresponding path program 1 times [2024-06-04 15:26:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431730232] [2024-06-04 15:26:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431730232] [2024-06-04 15:26:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431730232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:50,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:26:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591025566] [2024-06-04 15:26:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:26:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:26:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:26:50,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 15:26:50,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:50,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:50,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 15:26:50,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:50,329 INFO L124 PetriNetUnfolderBase]: 169/318 cut-off events. [2024-06-04 15:26:50,329 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-04 15:26:50,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 318 events. 169/318 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1201 event pairs, 70 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 710. Up to 281 conditions per place. [2024-06-04 15:26:50,335 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-04 15:26:50,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 171 flow [2024-06-04 15:26:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:26:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:26:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-06-04 15:26:50,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-04 15:26:50,338 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 68 transitions. [2024-06-04 15:26:50,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 171 flow [2024-06-04 15:26:50,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 15:26:50,342 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-04 15:26:50,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-04 15:26:50,343 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-04 15:26:50,343 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-04 15:26:50,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:50,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:50,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:50,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:26:50,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:50,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:50,347 INFO L85 PathProgramCache]: Analyzing trace with hash -19449273, now seen corresponding path program 1 times [2024-06-04 15:26:50,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:50,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513412534] [2024-06-04 15:26:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:50,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513412534] [2024-06-04 15:26:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513412534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:51,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:26:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326765971] [2024-06-04 15:26:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:51,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:26:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:26:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:26:51,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 15:26:51,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:51,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:51,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 15:26:51,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:51,169 INFO L124 PetriNetUnfolderBase]: 145/284 cut-off events. [2024-06-04 15:26:51,169 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-06-04 15:26:51,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 284 events. 145/284 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1091 event pairs, 76 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 701. Up to 256 conditions per place. [2024-06-04 15:26:51,171 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 25 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 15:26:51,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 179 flow [2024-06-04 15:26:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:26:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:26:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-06-04 15:26:51,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-04 15:26:51,173 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 70 transitions. [2024-06-04 15:26:51,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 179 flow [2024-06-04 15:26:51,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 15:26:51,174 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 117 flow [2024-06-04 15:26:51,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-04 15:26:51,175 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-04 15:26:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 117 flow [2024-06-04 15:26:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:51,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:51,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:26:51,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:51,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2049103687, now seen corresponding path program 1 times [2024-06-04 15:26:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9268592] [2024-06-04 15:26:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:52,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9268592] [2024-06-04 15:26:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9268592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:26:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056600381] [2024-06-04 15:26:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:52,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:26:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:26:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:26:52,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-04 15:26:52,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:52,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:52,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-04 15:26:52,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:52,444 INFO L124 PetriNetUnfolderBase]: 163/307 cut-off events. [2024-06-04 15:26:52,445 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2024-06-04 15:26:52,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 307 events. 163/307 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1160 event pairs, 29 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 821. Up to 252 conditions per place. [2024-06-04 15:26:52,447 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-04 15:26:52,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 235 flow [2024-06-04 15:26:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:26:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:26:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-04 15:26:52,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-04 15:26:52,448 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 117 flow. Second operand 6 states and 90 transitions. [2024-06-04 15:26:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 235 flow [2024-06-04 15:26:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 224 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 15:26:52,450 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 131 flow [2024-06-04 15:26:52,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-04 15:26:52,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-04 15:26:52,451 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 131 flow [2024-06-04 15:26:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:52,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:52,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:52,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:26:52,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:52,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -602926624, now seen corresponding path program 1 times [2024-06-04 15:26:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498283228] [2024-06-04 15:26:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:52,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-06-04 15:26:52,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:52,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498283228] [2024-06-04 15:26:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498283228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:26:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709662366] [2024-06-04 15:26:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 15:26:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 15:26:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 15:26:52,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2024-06-04 15:26:52,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:52,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:52,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2024-06-04 15:26:52,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:52,557 INFO L124 PetriNetUnfolderBase]: 46/132 cut-off events. [2024-06-04 15:26:52,557 INFO L125 PetriNetUnfolderBase]: For 134/139 co-relation queries the response was YES. [2024-06-04 15:26:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 132 events. 46/132 cut-off events. For 134/139 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 507 event pairs, 29 based on Foata normal form. 18/143 useless extension candidates. Maximal degree in co-relation 326. Up to 67 conditions per place. [2024-06-04 15:26:52,558 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 14 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2024-06-04 15:26:52,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 167 flow [2024-06-04 15:26:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 15:26:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 15:26:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-04 15:26:52,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2024-06-04 15:26:52,560 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 131 flow. Second operand 3 states and 61 transitions. [2024-06-04 15:26:52,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 167 flow [2024-06-04 15:26:52,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 151 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:26:52,561 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 119 flow [2024-06-04 15:26:52,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-04 15:26:52,562 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-04 15:26:52,562 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 119 flow [2024-06-04 15:26:52,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:52,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:52,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:26:52,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:52,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2112501718, now seen corresponding path program 1 times [2024-06-04 15:26:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679104448] [2024-06-04 15:26:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:53,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679104448] [2024-06-04 15:26:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679104448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:26:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950243947] [2024-06-04 15:26:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:26:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:26:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:26:53,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:53,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:53,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:53,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:53,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:53,282 INFO L124 PetriNetUnfolderBase]: 111/238 cut-off events. [2024-06-04 15:26:53,282 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2024-06-04 15:26:53,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 238 events. 111/238 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 838 event pairs, 52 based on Foata normal form. 2/240 useless extension candidates. Maximal degree in co-relation 683. Up to 198 conditions per place. [2024-06-04 15:26:53,284 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 30 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-04 15:26:53,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 233 flow [2024-06-04 15:26:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:26:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:26:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 15:26:53,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2024-06-04 15:26:53,285 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-06-04 15:26:53,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 233 flow [2024-06-04 15:26:53,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 226 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-04 15:26:53,286 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 149 flow [2024-06-04 15:26:53,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2024-06-04 15:26:53,287 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-06-04 15:26:53,287 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 149 flow [2024-06-04 15:26:53,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:53,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:53,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:53,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:26:53,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:53,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1510864218, now seen corresponding path program 2 times [2024-06-04 15:26:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760358316] [2024-06-04 15:26:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760358316] [2024-06-04 15:26:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760358316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:26:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52243329] [2024-06-04 15:26:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:53,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:26:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:26:53,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:26:53,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:53,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:53,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:53,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:53,985 INFO L124 PetriNetUnfolderBase]: 108/230 cut-off events. [2024-06-04 15:26:53,986 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2024-06-04 15:26:53,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 230 events. 108/230 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 792 event pairs, 55 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 722. Up to 184 conditions per place. [2024-06-04 15:26:53,987 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 27 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2024-06-04 15:26:53,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 255 flow [2024-06-04 15:26:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:26:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:26:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-04 15:26:53,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 15:26:53,988 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 149 flow. Second operand 6 states and 77 transitions. [2024-06-04 15:26:53,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 255 flow [2024-06-04 15:26:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 238 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:26:53,990 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 175 flow [2024-06-04 15:26:53,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-06-04 15:26:53,991 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2024-06-04 15:26:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 175 flow [2024-06-04 15:26:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:53,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:53,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:26:53,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:53,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -487217291, now seen corresponding path program 1 times [2024-06-04 15:26:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013297718] [2024-06-04 15:26:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013297718] [2024-06-04 15:26:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013297718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:54,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:26:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88682147] [2024-06-04 15:26:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:26:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:26:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:26:54,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:54,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:55,063 INFO L124 PetriNetUnfolderBase]: 121/262 cut-off events. [2024-06-04 15:26:55,064 INFO L125 PetriNetUnfolderBase]: For 784/784 co-relation queries the response was YES. [2024-06-04 15:26:55,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 262 events. 121/262 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 966 event pairs, 51 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 877. Up to 202 conditions per place. [2024-06-04 15:26:55,065 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2024-06-04 15:26:55,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 357 flow [2024-06-04 15:26:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:26:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:26:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 15:26:55,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-04 15:26:55,069 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 175 flow. Second operand 8 states and 101 transitions. [2024-06-04 15:26:55,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 357 flow [2024-06-04 15:26:55,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 328 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:26:55,073 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 246 flow [2024-06-04 15:26:55,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-04 15:26:55,075 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-04 15:26:55,075 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 246 flow [2024-06-04 15:26:55,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:55,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:55,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:55,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:26:55,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:55,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1410121675, now seen corresponding path program 2 times [2024-06-04 15:26:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921975535] [2024-06-04 15:26:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921975535] [2024-06-04 15:26:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921975535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:26:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314005114] [2024-06-04 15:26:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:55,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:26:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:26:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:26:55,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:55,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 246 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:55,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:55,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:56,072 INFO L124 PetriNetUnfolderBase]: 120/260 cut-off events. [2024-06-04 15:26:56,073 INFO L125 PetriNetUnfolderBase]: For 1000/1000 co-relation queries the response was YES. [2024-06-04 15:26:56,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 260 events. 120/260 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 955 event pairs, 51 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 942. Up to 195 conditions per place. [2024-06-04 15:26:56,074 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 35 selfloop transitions, 16 changer transitions 0/55 dead transitions. [2024-06-04 15:26:56,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 394 flow [2024-06-04 15:26:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:26:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:26:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 15:26:56,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-04 15:26:56,076 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 246 flow. Second operand 7 states and 90 transitions. [2024-06-04 15:26:56,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 394 flow [2024-06-04 15:26:56,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 373 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 15:26:56,078 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 276 flow [2024-06-04 15:26:56,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-06-04 15:26:56,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-04 15:26:56,079 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 276 flow [2024-06-04 15:26:56,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:56,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:56,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:56,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:26:56,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:56,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash -616488526, now seen corresponding path program 1 times [2024-06-04 15:26:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:56,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336457595] [2024-06-04 15:26:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336457595] [2024-06-04 15:26:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336457595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:26:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655040428] [2024-06-04 15:26:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:56,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:26:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:26:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:26:56,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2024-06-04 15:26:56,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:56,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:56,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2024-06-04 15:26:56,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:56,246 INFO L124 PetriNetUnfolderBase]: 35/113 cut-off events. [2024-06-04 15:26:56,246 INFO L125 PetriNetUnfolderBase]: For 435/438 co-relation queries the response was YES. [2024-06-04 15:26:56,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 113 events. 35/113 cut-off events. For 435/438 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 446 event pairs, 10 based on Foata normal form. 10/119 useless extension candidates. Maximal degree in co-relation 368. Up to 38 conditions per place. [2024-06-04 15:26:56,247 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 13 selfloop transitions, 9 changer transitions 0/36 dead transitions. [2024-06-04 15:26:56,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 36 transitions, 278 flow [2024-06-04 15:26:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:26:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:26:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-04 15:26:56,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-04 15:26:56,248 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 276 flow. Second operand 5 states and 80 transitions. [2024-06-04 15:26:56,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 36 transitions, 278 flow [2024-06-04 15:26:56,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 235 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 15:26:56,250 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 205 flow [2024-06-04 15:26:56,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2024-06-04 15:26:56,251 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-04 15:26:56,251 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 205 flow [2024-06-04 15:26:56,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:56,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:56,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:56,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:26:56,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:56,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash -276764380, now seen corresponding path program 1 times [2024-06-04 15:26:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051215519] [2024-06-04 15:26:56,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051215519] [2024-06-04 15:26:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051215519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:57,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:57,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:26:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29126953] [2024-06-04 15:26:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:57,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:26:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:26:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:26:57,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:57,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 205 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:57,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:57,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:57,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:57,379 INFO L124 PetriNetUnfolderBase]: 52/150 cut-off events. [2024-06-04 15:26:57,379 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-06-04 15:26:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 150 events. 52/150 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 593 event pairs, 1 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 484. Up to 52 conditions per place. [2024-06-04 15:26:57,381 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 26 selfloop transitions, 15 changer transitions 8/53 dead transitions. [2024-06-04 15:26:57,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 360 flow [2024-06-04 15:26:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 15:26:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 15:26:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 15:26:57,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 15:26:57,383 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 205 flow. Second operand 9 states and 104 transitions. [2024-06-04 15:26:57,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 360 flow [2024-06-04 15:26:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:26:57,385 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 232 flow [2024-06-04 15:26:57,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2024-06-04 15:26:57,385 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-06-04 15:26:57,386 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 232 flow [2024-06-04 15:26:57,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:57,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:57,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:57,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:26:57,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:57,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2079900820, now seen corresponding path program 2 times [2024-06-04 15:26:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767823612] [2024-06-04 15:26:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:58,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767823612] [2024-06-04 15:26:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767823612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:58,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:26:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963339177] [2024-06-04 15:26:58,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:58,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:26:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:26:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:26:58,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:58,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:58,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:58,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:58,422 INFO L124 PetriNetUnfolderBase]: 45/135 cut-off events. [2024-06-04 15:26:58,422 INFO L125 PetriNetUnfolderBase]: For 520/520 co-relation queries the response was YES. [2024-06-04 15:26:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 135 events. 45/135 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 524 event pairs, 2 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 487. Up to 48 conditions per place. [2024-06-04 15:26:58,423 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 23 selfloop transitions, 11 changer transitions 10/48 dead transitions. [2024-06-04 15:26:58,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 358 flow [2024-06-04 15:26:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:26:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:26:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 15:26:58,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-04 15:26:58,424 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 232 flow. Second operand 8 states and 92 transitions. [2024-06-04 15:26:58,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 358 flow [2024-06-04 15:26:58,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 326 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 15:26:58,427 INFO L231 Difference]: Finished difference. Result has 56 places, 30 transitions, 191 flow [2024-06-04 15:26:58,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=56, PETRI_TRANSITIONS=30} [2024-06-04 15:26:58,427 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-04 15:26:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 30 transitions, 191 flow [2024-06-04 15:26:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:58,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:58,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:26:58,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2079961270, now seen corresponding path program 3 times [2024-06-04 15:26:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185756944] [2024-06-04 15:26:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:26:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:26:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:26:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185756944] [2024-06-04 15:26:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185756944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:26:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:26:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:26:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273631202] [2024-06-04 15:26:59,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:26:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:26:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:26:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:26:59,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:26:59,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:26:59,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 30 transitions, 191 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:59,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:26:59,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:26:59,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:26:59,518 INFO L124 PetriNetUnfolderBase]: 28/102 cut-off events. [2024-06-04 15:26:59,518 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-06-04 15:26:59,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 102 events. 28/102 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 373 event pairs, 1 based on Foata normal form. 2/104 useless extension candidates. Maximal degree in co-relation 340. Up to 29 conditions per place. [2024-06-04 15:26:59,520 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 17 selfloop transitions, 6 changer transitions 14/41 dead transitions. [2024-06-04 15:26:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 41 transitions, 295 flow [2024-06-04 15:26:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:26:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:26:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 15:26:59,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 15:26:59,521 INFO L175 Difference]: Start difference. First operand has 56 places, 30 transitions, 191 flow. Second operand 8 states and 88 transitions. [2024-06-04 15:26:59,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 41 transitions, 295 flow [2024-06-04 15:26:59,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 267 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 15:26:59,522 INFO L231 Difference]: Finished difference. Result has 53 places, 23 transitions, 121 flow [2024-06-04 15:26:59,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=121, PETRI_PLACES=53, PETRI_TRANSITIONS=23} [2024-06-04 15:26:59,524 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2024-06-04 15:26:59,524 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 23 transitions, 121 flow [2024-06-04 15:26:59,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:26:59,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:26:59,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:26:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:26:59,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:26:59,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:26:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1931279212, now seen corresponding path program 4 times [2024-06-04 15:26:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:26:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49396741] [2024-06-04 15:26:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:26:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:26:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:27:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:27:00,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:27:00,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49396741] [2024-06-04 15:27:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49396741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:27:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:27:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:27:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131040322] [2024-06-04 15:27:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:27:00,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:27:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:27:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:27:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:27:00,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:27:00,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 23 transitions, 121 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:27:00,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:27:00,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:27:00,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:27:00,698 INFO L124 PetriNetUnfolderBase]: 15/65 cut-off events. [2024-06-04 15:27:00,698 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-06-04 15:27:00,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 65 events. 15/65 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 1 based on Foata normal form. 2/67 useless extension candidates. Maximal degree in co-relation 206. Up to 19 conditions per place. [2024-06-04 15:27:00,698 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 12 selfloop transitions, 3 changer transitions 13/32 dead transitions. [2024-06-04 15:27:00,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 32 transitions, 198 flow [2024-06-04 15:27:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:27:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:27:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-04 15:27:00,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-04 15:27:00,699 INFO L175 Difference]: Start difference. First operand has 53 places, 23 transitions, 121 flow. Second operand 8 states and 84 transitions. [2024-06-04 15:27:00,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 32 transitions, 198 flow [2024-06-04 15:27:00,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 32 transitions, 177 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 15:27:00,700 INFO L231 Difference]: Finished difference. Result has 47 places, 18 transitions, 77 flow [2024-06-04 15:27:00,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=47, PETRI_TRANSITIONS=18} [2024-06-04 15:27:00,700 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-04 15:27:00,700 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 18 transitions, 77 flow [2024-06-04 15:27:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:27:00,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:27:00,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:27:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:27:00,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 15:27:00,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:27:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -206783340, now seen corresponding path program 5 times [2024-06-04 15:27:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:27:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141932788] [2024-06-04 15:27:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:27:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:27:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:27:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:27:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:27:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141932788] [2024-06-04 15:27:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141932788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:27:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:27:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 15:27:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465397680] [2024-06-04 15:27:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:27:01,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 15:27:01,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:27:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 15:27:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 15:27:01,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 15:27:01,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 18 transitions, 77 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:27:01,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:27:01,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 15:27:01,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:27:01,688 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-04 15:27:01,688 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 15:27:01,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 29 events. 5/29 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 78. Up to 7 conditions per place. [2024-06-04 15:27:01,689 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2024-06-04 15:27:01,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 21 transitions, 105 flow [2024-06-04 15:27:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 15:27:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 15:27:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2024-06-04 15:27:01,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2803030303030303 [2024-06-04 15:27:01,690 INFO L175 Difference]: Start difference. First operand has 47 places, 18 transitions, 77 flow. Second operand 8 states and 74 transitions. [2024-06-04 15:27:01,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 21 transitions, 105 flow [2024-06-04 15:27:01,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 83 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 15:27:01,690 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2024-06-04 15:27:01,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2024-06-04 15:27:01,690 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2024-06-04 15:27:01,691 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2024-06-04 15:27:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:27:01,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 15:27:01,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 15:27:01,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 15:27:01,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 15:27:01,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:27:01,693 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1] [2024-06-04 15:27:01,696 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:27:01,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:27:01,699 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 15:27:01,699 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 15:27:01,699 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:27:01 BasicIcfg [2024-06-04 15:27:01,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:27:01,700 INFO L158 Benchmark]: Toolchain (without parser) took 14670.70ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 80.0MB in the beginning and 556.2MB in the end (delta: -476.2MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-06-04 15:27:01,700 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:27:01,700 INFO L158 Benchmark]: Witness Parser took 4.18ms. Allocated memory is still 142.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:27:01,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.17ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 79.5MB in the beginning and 180.2MB in the end (delta: -100.7MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-06-04 15:27:01,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.19ms. Allocated memory is still 222.3MB. Free memory was 180.2MB in the beginning and 177.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-04 15:27:01,700 INFO L158 Benchmark]: Boogie Preprocessor took 51.49ms. Allocated memory is still 222.3MB. Free memory was 177.1MB in the beginning and 172.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-04 15:27:01,701 INFO L158 Benchmark]: RCFGBuilder took 601.47ms. Allocated memory is still 222.3MB. Free memory was 172.9MB in the beginning and 102.6MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-06-04 15:27:01,701 INFO L158 Benchmark]: TraceAbstraction took 13333.44ms. Allocated memory was 222.3MB in the beginning and 654.3MB in the end (delta: 432.0MB). Free memory was 102.6MB in the beginning and 556.2MB in the end (delta: -453.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:27:01,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.18ms. Allocated memory is still 142.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.17ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 79.5MB in the beginning and 180.2MB in the end (delta: -100.7MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.19ms. Allocated memory is still 222.3MB. Free memory was 180.2MB in the beginning and 177.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.49ms. Allocated memory is still 222.3MB. Free memory was 177.1MB in the beginning and 172.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 601.47ms. Allocated memory is still 222.3MB. Free memory was 172.9MB in the beginning and 102.6MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13333.44ms. Allocated memory was 222.3MB in the beginning and 654.3MB in the end (delta: 432.0MB). Free memory was 102.6MB in the beginning and 556.2MB in the end (delta: -453.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 837]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 838]: 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, 53 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2202 IncrementalHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 31 mSDtfsCounter, 2202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 7914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 15:27:01,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE