./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.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/mix023_tso.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/mix023_tso.i ./goblint.2024-05-21_14-57-05.files/protection/mix023_tso.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-03 19:26:32,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 19:26:32,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 19:26:32,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 19:26:32,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 19:26:32,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 19:26:32,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 19:26:32,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 19:26:32,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 19:26:32,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 19:26:32,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 19:26:32,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 19:26:32,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 19:26:32,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 19:26:32,658 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 19:26:32,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 19:26:32,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 19:26:32,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 19:26:32,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 19:26:32,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 19:26:32,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 19:26:32,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 19:26:32,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 19:26:32,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 19:26:32,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 19:26:32,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 19:26:32,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 19:26:32,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 19:26:32,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 19:26:32,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 19:26:32,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 19:26:32,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 19:26:32,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:26:32,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 19:26:32,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 19:26:32,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 19:26:32,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 19:26:32,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 19:26:32,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 19:26:32,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 19:26:32,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 19:26:32,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 19:26:32,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 19:26:32,666 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-03 19:26:32,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 19:26:32,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 19:26:32,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 19:26:32,849 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 19:26:32,850 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 19:26:32,850 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/mix023_tso.yml/witness.yml [2024-06-03 19:26:33,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 19:26:33,112 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 19:26:33,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-06-03 19:26:34,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 19:26:34,328 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 19:26:34,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-06-03 19:26:34,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d451bb25/fa8ba9df2269416182a0d530eb9c18c0/FLAG8be29c8d0 [2024-06-03 19:26:34,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d451bb25/fa8ba9df2269416182a0d530eb9c18c0 [2024-06-03 19:26:34,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 19:26:34,364 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 19:26:34,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 19:26:34,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 19:26:34,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 19:26:34,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:26:33" (1/2) ... [2024-06-03 19:26:34,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e5abac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:26:34, skipping insertion in model container [2024-06-03 19:26:34,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:26:33" (1/2) ... [2024-06-03 19:26:34,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a60249f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:26:34, skipping insertion in model container [2024-06-03 19:26:34,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:26:34" (2/2) ... [2024-06-03 19:26:34,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e5abac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:34, skipping insertion in model container [2024-06-03 19:26:34,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:26:34" (2/2) ... [2024-06-03 19:26:34,383 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 19:26:34,585 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 19:26:34,586 INFO L97 edCorrectnessWitness]: Location invariant before [L927-L927] ((((((((((((((((((((((((((((((((((((! multithreaded || ((((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || ((((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) [2024-06-03 19:26:34,586 INFO L97 edCorrectnessWitness]: Location invariant before [L923-L923] ((((((((((((((((((((((((((((((((((((! multithreaded || ((((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || ((((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) [2024-06-03 19:26:34,587 INFO L97 edCorrectnessWitness]: Location invariant before [L925-L925] ((((((((((((((((((((((((((((((((((((! multithreaded || ((((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || ((((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) [2024-06-03 19:26:34,587 INFO L97 edCorrectnessWitness]: Location invariant before [L928-L928] ((((((((((((((((((((((((((((((((((((! multithreaded || ((((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= z$mem_tmp && z$mem_tmp <= 2) && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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)))) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || ((((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 2) && __unbuffered_p3_EAX <= 127) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) [2024-06-03 19:26:34,587 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 19:26:34,588 INFO L106 edCorrectnessWitness]: ghost_update [L921-L921] multithreaded = 1; [2024-06-03 19:26:34,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 19:26:34,948 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:26:34,956 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 19:26:35,114 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:26:35,163 INFO L206 MainTranslator]: Completed translation [2024-06-03 19:26:35,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35 WrapperNode [2024-06-03 19:26:35,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 19:26:35,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 19:26:35,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 19:26:35,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 19:26:35,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,241 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 286 [2024-06-03 19:26:35,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 19:26:35,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 19:26:35,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 19:26:35,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 19:26:35,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,274 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-03 19:26:35,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 19:26:35,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 19:26:35,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 19:26:35,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 19:26:35,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (1/1) ... [2024-06-03 19:26:35,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:26:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:26:35,421 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-03 19:26:35,472 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-03 19:26:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 19:26:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 19:26:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 19:26:35,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 19:26:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 19:26:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 19:26:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 19:26:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 19:26:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-03 19:26:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-03 19:26:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 19:26:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 19:26:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 19:26:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 19:26:35,486 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 19:26:35,609 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 19:26:35,611 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 19:26:36,045 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 19:26:36,046 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 19:26:36,375 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 19:26:36,375 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 19:26:36,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:26:36 BoogieIcfgContainer [2024-06-03 19:26:36,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 19:26:36,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 19:26:36,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 19:26:36,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 19:26:36,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:26:33" (1/4) ... [2024-06-03 19:26:36,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458eab71 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 07:26:36, skipping insertion in model container [2024-06-03 19:26:36,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 07:26:34" (2/4) ... [2024-06-03 19:26:36,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458eab71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:26:36, skipping insertion in model container [2024-06-03 19:26:36,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:26:35" (3/4) ... [2024-06-03 19:26:36,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458eab71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:26:36, skipping insertion in model container [2024-06-03 19:26:36,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:26:36" (4/4) ... [2024-06-03 19:26:36,383 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2024-06-03 19:26:36,395 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 19:26:36,395 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-03 19:26:36,396 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 19:26:36,455 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 19:26:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 124 flow [2024-06-03 19:26:36,518 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2024-06-03 19:26:36,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:26:36,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 19:26:36,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 54 transitions, 124 flow [2024-06-03 19:26:36,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 100 flow [2024-06-03 19:26:36,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 19:26:36,541 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;@60140da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 19:26:36,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-03 19:26:36,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 19:26:36,546 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 19:26:36,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:26:36,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:26:36,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 19:26:36,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:26:36,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:26:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2085727969, now seen corresponding path program 1 times [2024-06-03 19:26:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:26:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129309184] [2024-06-03 19:26:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:26:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:26:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:26:38,666 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-03 19:26:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:26:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129309184] [2024-06-03 19:26:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129309184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:26:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:26:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 19:26:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344252771] [2024-06-03 19:26:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:26:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 19:26:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:26:38,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 19:26:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 19:26:38,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-06-03 19:26:38,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 19:26:38,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:26:38,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-06-03 19:26:38,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:26:41,888 INFO L124 PetriNetUnfolderBase]: 14075/19406 cut-off events. [2024-06-03 19:26:41,889 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-06-03 19:26:41,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38924 conditions, 19406 events. 14075/19406 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 107132 event pairs, 11070 based on Foata normal form. 1/18892 useless extension candidates. Maximal degree in co-relation 38908. Up to 18981 conditions per place. [2024-06-03 19:26:41,984 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 47 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-06-03 19:26:41,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 241 flow [2024-06-03 19:26:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 19:26:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 19:26:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-03 19:26:41,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2024-06-03 19:26:41,994 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 92 transitions. [2024-06-03 19:26:41,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 241 flow [2024-06-03 19:26:41,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-03 19:26:42,003 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 135 flow [2024-06-03 19:26:42,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-03 19:26:42,007 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-03 19:26:42,007 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 135 flow [2024-06-03 19:26:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-03 19:26:42,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:26:42,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:26:42,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 19:26:42,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:26:42,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:26:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1365192958, now seen corresponding path program 1 times [2024-06-03 19:26:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:26:42,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585738118] [2024-06-03 19:26:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:26:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:26:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:26:43,656 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-03 19:26:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:26:43,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585738118] [2024-06-03 19:26:43,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585738118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:26:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:26:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 19:26:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960162291] [2024-06-03 19:26:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:26:43,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 19:26:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:26:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 19:26:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 19:26:43,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-03 19:26:43,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03 19:26:43,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:26:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-03 19:26:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:26:46,902 INFO L124 PetriNetUnfolderBase]: 16117/21732 cut-off events. [2024-06-03 19:26:46,903 INFO L125 PetriNetUnfolderBase]: For 3947/3947 co-relation queries the response was YES. [2024-06-03 19:26:46,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49107 conditions, 21732 events. 16117/21732 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 115269 event pairs, 11693 based on Foata normal form. 4/21728 useless extension candidates. Maximal degree in co-relation 49092. Up to 21646 conditions per place. [2024-06-03 19:26:46,985 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 58 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2024-06-03 19:26:46,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 335 flow [2024-06-03 19:26:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 19:26:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 19:26:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-06-03 19:26:46,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2024-06-03 19:26:46,989 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 135 flow. Second operand 4 states and 115 transitions. [2024-06-03 19:26:46,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 335 flow [2024-06-03 19:26:46,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:26:46,992 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 183 flow [2024-06-03 19:26:46,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-06-03 19:26:46,993 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2024-06-03 19:26:46,993 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 183 flow [2024-06-03 19:26:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03 19:26:46,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:26:46,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:26:46,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 19:26:46,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:26:47,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:26:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -628689828, now seen corresponding path program 1 times [2024-06-03 19:26:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:26:47,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330935882] [2024-06-03 19:26:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:26:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:26:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:26:48,863 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-03 19:26:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:26:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330935882] [2024-06-03 19:26:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330935882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:26:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:26:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 19:26:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881719836] [2024-06-03 19:26:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:26:48,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 19:26:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:26:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 19:26:48,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 19:26:48,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-03 19:26:48,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03 19:26:48,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:26:48,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-03 19:26:48,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:26:52,261 INFO L124 PetriNetUnfolderBase]: 16097/21706 cut-off events. [2024-06-03 19:26:52,261 INFO L125 PetriNetUnfolderBase]: For 11213/11213 co-relation queries the response was YES. [2024-06-03 19:26:52,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54172 conditions, 21706 events. 16097/21706 cut-off events. For 11213/11213 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 115050 event pairs, 9531 based on Foata normal form. 8/21708 useless extension candidates. Maximal degree in co-relation 54155. Up to 21576 conditions per place. [2024-06-03 19:26:52,341 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-06-03 19:26:52,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 447 flow [2024-06-03 19:26:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:26:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:26:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-06-03 19:26:52,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-06-03 19:26:52,343 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 183 flow. Second operand 5 states and 141 transitions. [2024-06-03 19:26:52,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 447 flow [2024-06-03 19:26:52,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 428 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 19:26:52,347 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 231 flow [2024-06-03 19:26:52,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-06-03 19:26:52,348 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2024-06-03 19:26:52,348 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 231 flow [2024-06-03 19:26:52,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03 19:26:52,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:26:52,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:26:52,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 19:26:52,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:26:52,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:26:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash 559447117, now seen corresponding path program 1 times [2024-06-03 19:26:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:26:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890702974] [2024-06-03 19:26:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:26:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:26:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:26:55,125 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-03 19:26:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:26:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890702974] [2024-06-03 19:26:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890702974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:26:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:26:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:26:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955680017] [2024-06-03 19:26:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:26:55,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:26:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:26:55,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:26:55,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:26:55,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-03 19:26:55,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:26:55,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:26:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-03 19:26:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:26:58,437 INFO L124 PetriNetUnfolderBase]: 16081/21680 cut-off events. [2024-06-03 19:26:58,437 INFO L125 PetriNetUnfolderBase]: For 21720/21720 co-relation queries the response was YES. [2024-06-03 19:26:58,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59196 conditions, 21680 events. 16081/21680 cut-off events. For 21720/21720 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 115050 event pairs, 8286 based on Foata normal form. 8/21680 useless extension candidates. Maximal degree in co-relation 59178. Up to 21510 conditions per place. [2024-06-03 19:26:58,575 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 76 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-03 19:26:58,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 531 flow [2024-06-03 19:26:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:26:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:26:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-03 19:26:58,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-03 19:26:58,580 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 231 flow. Second operand 6 states and 162 transitions. [2024-06-03 19:26:58,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 531 flow [2024-06-03 19:26:58,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 498 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-03 19:26:58,591 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 262 flow [2024-06-03 19:26:58,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-03 19:26:58,593 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2024-06-03 19:26:58,593 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 262 flow [2024-06-03 19:26:58,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:26:58,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:26:58,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:26:58,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 19:26:58,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:26:58,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:26:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 785829536, now seen corresponding path program 1 times [2024-06-03 19:26:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:26:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625332085] [2024-06-03 19:26:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:26:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:26:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:00,623 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-03 19:27:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625332085] [2024-06-03 19:27:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625332085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:00,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:00,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:27:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582228874] [2024-06-03 19:27:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:00,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:27:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:27:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:27:00,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-03 19:27:00,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 19:27:00,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:00,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-03 19:27:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:03,441 INFO L124 PetriNetUnfolderBase]: 14020/19328 cut-off events. [2024-06-03 19:27:03,441 INFO L125 PetriNetUnfolderBase]: For 28956/28956 co-relation queries the response was YES. [2024-06-03 19:27:03,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56157 conditions, 19328 events. 14020/19328 cut-off events. For 28956/28956 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 106384 event pairs, 8568 based on Foata normal form. 3/19077 useless extension candidates. Maximal degree in co-relation 56138. Up to 18888 conditions per place. [2024-06-03 19:27:03,512 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 63 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2024-06-03 19:27:03,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 478 flow [2024-06-03 19:27:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:27:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:27:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-03 19:27:03,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 19:27:03,517 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 262 flow. Second operand 5 states and 120 transitions. [2024-06-03 19:27:03,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 478 flow [2024-06-03 19:27:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 432 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 19:27:03,524 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 281 flow [2024-06-03 19:27:03,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2024-06-03 19:27:03,527 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-06-03 19:27:03,527 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 281 flow [2024-06-03 19:27:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-03 19:27:03,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:03,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:03,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 19:27:03,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:03,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1409086000, now seen corresponding path program 1 times [2024-06-03 19:27:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319067184] [2024-06-03 19:27:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:06,011 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-03 19:27:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:06,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319067184] [2024-06-03 19:27:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319067184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:27:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969826773] [2024-06-03 19:27:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:06,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:27:06,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:27:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:27:06,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2024-06-03 19:27:06,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-03 19:27:06,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:06,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2024-06-03 19:27:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:09,049 INFO L124 PetriNetUnfolderBase]: 14002/19304 cut-off events. [2024-06-03 19:27:09,049 INFO L125 PetriNetUnfolderBase]: For 41575/41575 co-relation queries the response was YES. [2024-06-03 19:27:09,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60405 conditions, 19304 events. 14002/19304 cut-off events. For 41575/41575 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 106283 event pairs, 8276 based on Foata normal form. 6/19056 useless extension candidates. Maximal degree in co-relation 60384. Up to 18834 conditions per place. [2024-06-03 19:27:09,160 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 71 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-06-03 19:27:09,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 547 flow [2024-06-03 19:27:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:27:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:27:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-03 19:27:09,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2024-06-03 19:27:09,162 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 281 flow. Second operand 6 states and 143 transitions. [2024-06-03 19:27:09,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 547 flow [2024-06-03 19:27:09,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 514 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-03 19:27:09,169 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 327 flow [2024-06-03 19:27:09,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=327, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-06-03 19:27:09,170 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2024-06-03 19:27:09,170 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 327 flow [2024-06-03 19:27:09,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-03 19:27:09,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:09,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:09,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 19:27:09,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:09,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1671292869, now seen corresponding path program 1 times [2024-06-03 19:27:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303224791] [2024-06-03 19:27:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:27:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:11,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303224791] [2024-06-03 19:27:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303224791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:11,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:11,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:27:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956168656] [2024-06-03 19:27:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:11,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:27:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:27:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:27:11,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:11,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03 19:27:11,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:11,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:11,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:14,581 INFO L124 PetriNetUnfolderBase]: 16076/21674 cut-off events. [2024-06-03 19:27:14,581 INFO L125 PetriNetUnfolderBase]: For 66167/66167 co-relation queries the response was YES. [2024-06-03 19:27:14,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73196 conditions, 21674 events. 16076/21674 cut-off events. For 66167/66167 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 114861 event pairs, 9581 based on Foata normal form. 3/21675 useless extension candidates. Maximal degree in co-relation 73174. Up to 21573 conditions per place. [2024-06-03 19:27:14,671 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 78 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2024-06-03 19:27:14,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 617 flow [2024-06-03 19:27:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:27:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:27:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-03 19:27:14,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2024-06-03 19:27:14,673 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 327 flow. Second operand 6 states and 140 transitions. [2024-06-03 19:27:14,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 617 flow [2024-06-03 19:27:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 97 transitions, 570 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 19:27:14,681 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 363 flow [2024-06-03 19:27:14,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2024-06-03 19:27:14,682 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2024-06-03 19:27:14,682 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 363 flow [2024-06-03 19:27:14,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03 19:27:14,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:14,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 19:27:14,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:14,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 376226415, now seen corresponding path program 2 times [2024-06-03 19:27:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172354805] [2024-06-03 19:27:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:16,631 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-03 19:27:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172354805] [2024-06-03 19:27:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172354805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:27:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804048384] [2024-06-03 19:27:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:27:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:27:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:27:16,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:16,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 363 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03 19:27:16,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:16,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:19,816 INFO L124 PetriNetUnfolderBase]: 16067/21665 cut-off events. [2024-06-03 19:27:19,816 INFO L125 PetriNetUnfolderBase]: For 86055/86071 co-relation queries the response was YES. [2024-06-03 19:27:19,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78060 conditions, 21665 events. 16067/21665 cut-off events. For 86055/86071 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 114730 event pairs, 9585 based on Foata normal form. 15/21676 useless extension candidates. Maximal degree in co-relation 78037. Up to 21531 conditions per place. [2024-06-03 19:27:19,910 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 72 selfloop transitions, 21 changer transitions 0/98 dead transitions. [2024-06-03 19:27:19,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 655 flow [2024-06-03 19:27:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:27:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:27:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-06-03 19:27:19,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42901234567901236 [2024-06-03 19:27:19,912 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 363 flow. Second operand 6 states and 139 transitions. [2024-06-03 19:27:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 655 flow [2024-06-03 19:27:19,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 604 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 19:27:19,923 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 417 flow [2024-06-03 19:27:19,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2024-06-03 19:27:19,923 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-06-03 19:27:19,924 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 417 flow [2024-06-03 19:27:19,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03 19:27:19,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:19,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:19,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 19:27:19,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:19,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash 871096301, now seen corresponding path program 1 times [2024-06-03 19:27:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133695009] [2024-06-03 19:27:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:21,893 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-03 19:27:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133695009] [2024-06-03 19:27:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133695009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:21,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200604124] [2024-06-03 19:27:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:21,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:22,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:22,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 417 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:22,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:22,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:22,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:25,058 INFO L124 PetriNetUnfolderBase]: 16203/21859 cut-off events. [2024-06-03 19:27:25,058 INFO L125 PetriNetUnfolderBase]: For 110853/110861 co-relation queries the response was YES. [2024-06-03 19:27:25,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83765 conditions, 21859 events. 16203/21859 cut-off events. For 110853/110861 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 115601 event pairs, 8662 based on Foata normal form. 14/21871 useless extension candidates. Maximal degree in co-relation 83741. Up to 21633 conditions per place. [2024-06-03 19:27:25,214 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 99 selfloop transitions, 32 changer transitions 0/136 dead transitions. [2024-06-03 19:27:25,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 136 transitions, 907 flow [2024-06-03 19:27:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:27:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:27:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-03 19:27:25,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 19:27:25,244 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 417 flow. Second operand 8 states and 189 transitions. [2024-06-03 19:27:25,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 136 transitions, 907 flow [2024-06-03 19:27:25,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 826 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-03 19:27:25,267 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 571 flow [2024-06-03 19:27:25,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=571, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-06-03 19:27:25,268 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2024-06-03 19:27:25,269 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 571 flow [2024-06-03 19:27:25,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:25,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:25,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 19:27:25,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:25,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1394260051, now seen corresponding path program 2 times [2024-06-03 19:27:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:25,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931182898] [2024-06-03 19:27:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:27,362 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-03 19:27:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931182898] [2024-06-03 19:27:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931182898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:27,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026747723] [2024-06-03 19:27:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:27,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:27,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:27,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:27,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:27,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:27,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:30,633 INFO L124 PetriNetUnfolderBase]: 16247/21919 cut-off events. [2024-06-03 19:27:30,633 INFO L125 PetriNetUnfolderBase]: For 139372/139384 co-relation queries the response was YES. [2024-06-03 19:27:30,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90526 conditions, 21919 events. 16247/21919 cut-off events. For 139372/139384 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 115994 event pairs, 8495 based on Foata normal form. 18/21935 useless extension candidates. Maximal degree in co-relation 90498. Up to 21655 conditions per place. [2024-06-03 19:27:30,756 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 97 selfloop transitions, 41 changer transitions 0/143 dead transitions. [2024-06-03 19:27:30,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 143 transitions, 1081 flow [2024-06-03 19:27:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:27:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:27:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-03 19:27:30,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-03 19:27:30,758 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 571 flow. Second operand 7 states and 166 transitions. [2024-06-03 19:27:30,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 143 transitions, 1081 flow [2024-06-03 19:27:30,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 143 transitions, 1004 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-03 19:27:30,778 INFO L231 Difference]: Finished difference. Result has 84 places, 104 transitions, 718 flow [2024-06-03 19:27:30,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=718, PETRI_PLACES=84, PETRI_TRANSITIONS=104} [2024-06-03 19:27:30,779 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-06-03 19:27:30,779 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 104 transitions, 718 flow [2024-06-03 19:27:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:30,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:30,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:30,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 19:27:30,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:30,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1394255401, now seen corresponding path program 3 times [2024-06-03 19:27:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133787121] [2024-06-03 19:27:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:27:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:32,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133787121] [2024-06-03 19:27:32,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133787121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:32,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:32,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:32,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907743947] [2024-06-03 19:27:32,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:32,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:33,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:33,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 104 transitions, 718 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:33,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:33,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:33,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:36,220 INFO L124 PetriNetUnfolderBase]: 16322/22030 cut-off events. [2024-06-03 19:27:36,221 INFO L125 PetriNetUnfolderBase]: For 175505/175505 co-relation queries the response was YES. [2024-06-03 19:27:36,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97251 conditions, 22030 events. 16322/22030 cut-off events. For 175505/175505 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 116886 event pairs, 8392 based on Foata normal form. 6/22034 useless extension candidates. Maximal degree in co-relation 97221. Up to 21678 conditions per place. [2024-06-03 19:27:36,366 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 96 selfloop transitions, 49 changer transitions 0/150 dead transitions. [2024-06-03 19:27:36,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 150 transitions, 1318 flow [2024-06-03 19:27:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:27:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:27:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-03 19:27:36,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-03 19:27:36,373 INFO L175 Difference]: Start difference. First operand has 84 places, 104 transitions, 718 flow. Second operand 7 states and 169 transitions. [2024-06-03 19:27:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 150 transitions, 1318 flow [2024-06-03 19:27:36,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 150 transitions, 1197 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-03 19:27:36,424 INFO L231 Difference]: Finished difference. Result has 88 places, 112 transitions, 852 flow [2024-06-03 19:27:36,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=852, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2024-06-03 19:27:36,425 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-06-03 19:27:36,425 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 112 transitions, 852 flow [2024-06-03 19:27:36,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:36,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:36,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:36,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 19:27:36,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:36,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1394255215, now seen corresponding path program 1 times [2024-06-03 19:27:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670252882] [2024-06-03 19:27:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:38,815 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-03 19:27:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670252882] [2024-06-03 19:27:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670252882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729844492] [2024-06-03 19:27:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:38,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:38,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:38,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:38,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:38,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 112 transitions, 852 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:38,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:38,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:42,273 INFO L124 PetriNetUnfolderBase]: 16366/22098 cut-off events. [2024-06-03 19:27:42,273 INFO L125 PetriNetUnfolderBase]: For 176938/176950 co-relation queries the response was YES. [2024-06-03 19:27:42,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96579 conditions, 22098 events. 16366/22098 cut-off events. For 176938/176950 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 117125 event pairs, 8284 based on Foata normal form. 18/22114 useless extension candidates. Maximal degree in co-relation 96548. Up to 21925 conditions per place. [2024-06-03 19:27:42,434 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 126 selfloop transitions, 22 changer transitions 0/153 dead transitions. [2024-06-03 19:27:42,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 153 transitions, 1328 flow [2024-06-03 19:27:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:27:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:27:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-06-03 19:27:42,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 19:27:42,436 INFO L175 Difference]: Start difference. First operand has 88 places, 112 transitions, 852 flow. Second operand 7 states and 162 transitions. [2024-06-03 19:27:42,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 153 transitions, 1328 flow [2024-06-03 19:27:42,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 153 transitions, 1249 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 19:27:42,515 INFO L231 Difference]: Finished difference. Result has 92 places, 116 transitions, 892 flow [2024-06-03 19:27:42,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=892, PETRI_PLACES=92, PETRI_TRANSITIONS=116} [2024-06-03 19:27:42,515 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2024-06-03 19:27:42,515 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 892 flow [2024-06-03 19:27:42,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:42,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:42,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 19:27:42,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:42,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1217123881, now seen corresponding path program 4 times [2024-06-03 19:27:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621040912] [2024-06-03 19:27:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:44,532 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-03 19:27:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621040912] [2024-06-03 19:27:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621040912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:44,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:44,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222955199] [2024-06-03 19:27:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:44,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:44,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 892 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:44,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:44,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:47,893 INFO L124 PetriNetUnfolderBase]: 16348/22078 cut-off events. [2024-06-03 19:27:47,894 INFO L125 PetriNetUnfolderBase]: For 203626/203642 co-relation queries the response was YES. [2024-06-03 19:27:47,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101321 conditions, 22078 events. 16348/22078 cut-off events. For 203626/203642 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 116913 event pairs, 8179 based on Foata normal form. 14/22079 useless extension candidates. Maximal degree in co-relation 101288. Up to 21654 conditions per place. [2024-06-03 19:27:48,051 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 92 selfloop transitions, 59 changer transitions 0/156 dead transitions. [2024-06-03 19:27:48,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 156 transitions, 1440 flow [2024-06-03 19:27:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:27:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:27:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-03 19:27:48,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 19:27:48,053 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 892 flow. Second operand 7 states and 168 transitions. [2024-06-03 19:27:48,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 156 transitions, 1440 flow [2024-06-03 19:27:48,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 156 transitions, 1353 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-03 19:27:48,157 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 1010 flow [2024-06-03 19:27:48,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1010, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2024-06-03 19:27:48,158 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2024-06-03 19:27:48,158 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 120 transitions, 1010 flow [2024-06-03 19:27:48,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:48,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:48,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 19:27:48,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:48,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1217123695, now seen corresponding path program 2 times [2024-06-03 19:27:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576798670] [2024-06-03 19:27:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:50,562 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-03 19:27:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576798670] [2024-06-03 19:27:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576798670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:50,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903137587] [2024-06-03 19:27:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:50,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:50,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:50,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 120 transitions, 1010 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:50,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:50,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:50,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:27:54,265 INFO L124 PetriNetUnfolderBase]: 16370/22102 cut-off events. [2024-06-03 19:27:54,266 INFO L125 PetriNetUnfolderBase]: For 241770/241804 co-relation queries the response was YES. [2024-06-03 19:27:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106537 conditions, 22102 events. 16370/22102 cut-off events. For 241770/241804 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 117002 event pairs, 8170 based on Foata normal form. 29/22125 useless extension candidates. Maximal degree in co-relation 106503. Up to 21916 conditions per place. [2024-06-03 19:27:54,443 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 124 selfloop transitions, 29 changer transitions 0/158 dead transitions. [2024-06-03 19:27:54,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 158 transitions, 1496 flow [2024-06-03 19:27:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:27:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:27:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-06-03 19:27:54,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-03 19:27:54,445 INFO L175 Difference]: Start difference. First operand has 94 places, 120 transitions, 1010 flow. Second operand 7 states and 160 transitions. [2024-06-03 19:27:54,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 158 transitions, 1496 flow [2024-06-03 19:27:54,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1323 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-03 19:27:54,550 INFO L231 Difference]: Finished difference. Result has 96 places, 124 transitions, 978 flow [2024-06-03 19:27:54,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=978, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2024-06-03 19:27:54,551 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2024-06-03 19:27:54,551 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 124 transitions, 978 flow [2024-06-03 19:27:54,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:54,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:27:54,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:27:54,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 19:27:54,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:27:54,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:27:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1217117185, now seen corresponding path program 3 times [2024-06-03 19:27:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:27:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127684849] [2024-06-03 19:27:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:27:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:27:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:27:56,929 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-03 19:27:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:27:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127684849] [2024-06-03 19:27:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127684849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:27:56,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:27:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:27:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073744694] [2024-06-03 19:27:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:27:56,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:27:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:27:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:27:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:27:57,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:27:57,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 124 transitions, 978 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:27:57,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:27:57,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:27:57,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:01,178 INFO L124 PetriNetUnfolderBase]: 16383/22120 cut-off events. [2024-06-03 19:28:01,179 INFO L125 PetriNetUnfolderBase]: For 283106/283140 co-relation queries the response was YES. [2024-06-03 19:28:01,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111166 conditions, 22120 events. 16383/22120 cut-off events. For 283106/283140 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 117543 event pairs, 7873 based on Foata normal form. 32/22146 useless extension candidates. Maximal degree in co-relation 111131. Up to 21818 conditions per place. [2024-06-03 19:28:01,304 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 123 selfloop transitions, 43 changer transitions 0/171 dead transitions. [2024-06-03 19:28:01,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 171 transitions, 1666 flow [2024-06-03 19:28:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:28:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:28:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-03 19:28:01,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-03 19:28:01,325 INFO L175 Difference]: Start difference. First operand has 96 places, 124 transitions, 978 flow. Second operand 7 states and 166 transitions. [2024-06-03 19:28:01,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 171 transitions, 1666 flow [2024-06-03 19:28:01,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 171 transitions, 1557 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-03 19:28:01,396 INFO L231 Difference]: Finished difference. Result has 98 places, 132 transitions, 1122 flow [2024-06-03 19:28:01,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1122, PETRI_PLACES=98, PETRI_TRANSITIONS=132} [2024-06-03 19:28:01,397 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2024-06-03 19:28:01,398 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 1122 flow [2024-06-03 19:28:01,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-03 19:28:01,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:01,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:01,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 19:28:01,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:01,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1751089106, now seen corresponding path program 1 times [2024-06-03 19:28:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:01,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320130220] [2024-06-03 19:28:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:01,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:28:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320130220] [2024-06-03 19:28:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320130220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:28:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705042418] [2024-06-03 19:28:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:03,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:28:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:28:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:28:03,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:28:03,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 1122 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03 19:28:03,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:03,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:28:03,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:28:06,944 INFO L124 PetriNetUnfolderBase]: 16830/23180 cut-off events. [2024-06-03 19:28:06,945 INFO L125 PetriNetUnfolderBase]: For 305376/305376 co-relation queries the response was YES. [2024-06-03 19:28:06,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119014 conditions, 23180 events. 16830/23180 cut-off events. For 305376/305376 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 127013 event pairs, 8572 based on Foata normal form. 2/22934 useless extension candidates. Maximal degree in co-relation 118978. Up to 22645 conditions per place. [2024-06-03 19:28:07,090 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 135 selfloop transitions, 10 changer transitions 0/150 dead transitions. [2024-06-03 19:28:07,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 150 transitions, 1506 flow [2024-06-03 19:28:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:28:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:28:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-03 19:28:07,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2024-06-03 19:28:07,092 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 1122 flow. Second operand 5 states and 112 transitions. [2024-06-03 19:28:07,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 150 transitions, 1506 flow [2024-06-03 19:28:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 150 transitions, 1414 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-03 19:28:07,234 INFO L231 Difference]: Finished difference. Result has 100 places, 136 transitions, 1117 flow [2024-06-03 19:28:07,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1117, PETRI_PLACES=100, PETRI_TRANSITIONS=136} [2024-06-03 19:28:07,235 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 43 predicate places. [2024-06-03 19:28:07,235 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 136 transitions, 1117 flow [2024-06-03 19:28:07,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03 19:28:07,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:28:07,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:28:07,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 19:28:07,236 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 19:28:07,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:28:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash -209067676, now seen corresponding path program 1 times [2024-06-03 19:28:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:28:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767512371] [2024-06-03 19:28:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:28:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:28:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:28:10,227 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-03 19:28:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:28:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767512371] [2024-06-03 19:28:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767512371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:28:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:28:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:28:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111495684] [2024-06-03 19:28:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:28:10,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:28:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:28:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:28:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:28:10,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2024-06-03 19:28:10,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 136 transitions, 1117 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 19:28:10,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:28:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2024-06-03 19:28:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand