./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe019_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe019_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:04:39,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:04:40,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:04:40,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:04:40,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:04:40,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:04:40,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:04:40,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:04:40,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:04:40,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:04:40,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:04:40,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:04:40,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:04:40,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:04:40,117 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:04:40,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:04:40,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:04:40,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:04:40,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:04:40,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:04:40,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:04:40,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:04:40,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:04:40,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:04:40,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:04:40,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:04:40,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:04:40,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:04:40,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:04:40,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:04:40,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:04:40,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:04:40,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:04:40,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:04:40,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:04:40,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:04:40,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:04:40,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:04:40,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:04:40,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:04:40,123 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:04:40,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:04:40,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:04:40,124 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:04:40,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:04:40,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:04:40,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:04:40,370 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:04:40,371 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:04:40,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe019_power.oepc.yml/witness.yml [2024-06-28 02:04:40,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:04:40,593 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:04:40,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2024-06-28 02:04:41,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:04:41,938 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:04:41,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2024-06-28 02:04:41,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec772a2b/2c77873748c24b3b9e2e1481fe3c8f28/FLAG8ee109923 [2024-06-28 02:04:41,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec772a2b/2c77873748c24b3b9e2e1481fe3c8f28 [2024-06-28 02:04:41,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:04:41,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:04:41,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:04:41,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:04:41,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:04:41,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:04:40" (1/2) ... [2024-06-28 02:04:41,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddac737 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:04:41, skipping insertion in model container [2024-06-28 02:04:41,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:04:40" (1/2) ... [2024-06-28 02:04:41,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2e345031 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:04:41, skipping insertion in model container [2024-06-28 02:04:41,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:04:41" (2/2) ... [2024-06-28 02:04:41,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddac737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:41, skipping insertion in model container [2024-06-28 02:04:41,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:04:41" (2/2) ... [2024-06-28 02:04:41,977 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:04:42,149 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:04:42,150 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff0_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0) [2024-06-28 02:04:42,150 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff0_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0) [2024-06-28 02:04:42,150 INFO L97 edCorrectnessWitness]: Location invariant before [L861-L861] ((((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff0_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0) [2024-06-28 02:04:42,151 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] ((((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff0_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0) [2024-06-28 02:04:42,151 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:04:42,151 INFO L106 edCorrectnessWitness]: ghost_update [L855-L855] multithreaded = 1; [2024-06-28 02:04:42,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:04:42,343 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] [2024-06-28 02:04:42,519 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:04:42,534 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:04:42,561 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:04:42,658 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:04:42,698 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:04:42,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42 WrapperNode [2024-06-28 02:04:42,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:04:42,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:04:42,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:04:42,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:04:42,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,786 INFO L138 Inliner]: procedures = 176, calls = 119, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 326 [2024-06-28 02:04:42,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:04:42,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:04:42,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:04:42,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:04:42,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,850 INFO L175 MemorySlicer]: Split 74 memory accesses to 2 slices as follows [2, 72]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-28 02:04:42,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:04:42,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:04:42,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:04:42,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:04:42,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (1/1) ... [2024-06-28 02:04:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:04:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:04:42,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:04:42,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:04:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:04:42,985 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:04:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:04:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:04:42,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:04:42,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:04:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:04:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:04:42,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:04:42,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:04:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:04:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:04:42,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:04:42,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:04:42,992 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:04:43,115 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:04:43,117 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:04:43,642 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:04:43,643 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:04:44,160 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:04:44,160 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:04:44,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:04:44 BoogieIcfgContainer [2024-06-28 02:04:44,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:04:44,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:04:44,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:04:44,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:04:44,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:04:40" (1/4) ... [2024-06-28 02:04:44,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482e59 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:04:44, skipping insertion in model container [2024-06-28 02:04:44,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:04:41" (2/4) ... [2024-06-28 02:04:44,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:04:44, skipping insertion in model container [2024-06-28 02:04:44,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:04:42" (3/4) ... [2024-06-28 02:04:44,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:04:44, skipping insertion in model container [2024-06-28 02:04:44,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:04:44" (4/4) ... [2024-06-28 02:04:44,167 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2024-06-28 02:04:44,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:04:44,181 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 02:04:44,181 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:04:44,236 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:04:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:04:44,341 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-28 02:04:44,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:04:44,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-28 02:04:44,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:04:44,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 112 flow [2024-06-28 02:04:44,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:04:44,373 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;@40d08f4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:04:44,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 02:04:44,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:04:44,377 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:04:44,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:04:44,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:44,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:04:44,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:44,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 987668973, now seen corresponding path program 1 times [2024-06-28 02:04:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881118715] [2024-06-28 02:04:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:46,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881118715] [2024-06-28 02:04:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881118715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:46,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:04:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522672071] [2024-06-28 02:04:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:04:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:04:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:04:46,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-28 02:04:46,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:04:46,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:46,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-28 02:04:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:04:49,361 INFO L124 PetriNetUnfolderBase]: 11806/16802 cut-off events. [2024-06-28 02:04:49,361 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-06-28 02:04:49,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32913 conditions, 16802 events. 11806/16802 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 102944 event pairs, 8140 based on Foata normal form. 0/16297 useless extension candidates. Maximal degree in co-relation 32900. Up to 15885 conditions per place. [2024-06-28 02:04:49,445 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 55 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-06-28 02:04:49,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 287 flow [2024-06-28 02:04:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:04:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:04:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-28 02:04:49,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6608187134502924 [2024-06-28 02:04:49,473 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 112 flow. Second operand 3 states and 113 transitions. [2024-06-28 02:04:49,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 287 flow [2024-06-28 02:04:49,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:04:49,478 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 154 flow [2024-06-28 02:04:49,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-06-28 02:04:49,482 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-06-28 02:04:49,485 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 154 flow [2024-06-28 02:04:49,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:04:49,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:49,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:04:49,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:04:49,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:49,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash -37829364, now seen corresponding path program 1 times [2024-06-28 02:04:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:49,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4475047] [2024-06-28 02:04:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4475047] [2024-06-28 02:04:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4475047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:52,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:52,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:04:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314384530] [2024-06-28 02:04:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:52,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:04:52,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:04:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:04:52,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-28 02:04:52,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:04:52,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:52,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-28 02:04:52,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:04:54,941 INFO L124 PetriNetUnfolderBase]: 11796/16197 cut-off events. [2024-06-28 02:04:54,941 INFO L125 PetriNetUnfolderBase]: For 3133/3141 co-relation queries the response was YES. [2024-06-28 02:04:54,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36783 conditions, 16197 events. 11796/16197 cut-off events. For 3133/3141 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 93863 event pairs, 6261 based on Foata normal form. 7/16200 useless extension candidates. Maximal degree in co-relation 36771. Up to 15830 conditions per place. [2024-06-28 02:04:55,007 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 76 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-28 02:04:55,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 450 flow [2024-06-28 02:04:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:04:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:04:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-06-28 02:04:55,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6710526315789473 [2024-06-28 02:04:55,010 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 154 flow. Second operand 4 states and 153 transitions. [2024-06-28 02:04:55,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 450 flow [2024-06-28 02:04:55,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:04:55,013 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 237 flow [2024-06-28 02:04:55,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-28 02:04:55,014 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-06-28 02:04:55,014 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 237 flow [2024-06-28 02:04:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:04:55,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:55,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:04:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:04:55,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:55,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1691227901, now seen corresponding path program 1 times [2024-06-28 02:04:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989173660] [2024-06-28 02:04:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989173660] [2024-06-28 02:04:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989173660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:58,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:58,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:04:58,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45951978] [2024-06-28 02:04:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:58,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:04:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:58,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:04:58,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:04:58,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-28 02:04:58,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:04:58,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:58,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-28 02:04:58,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:02,230 INFO L124 PetriNetUnfolderBase]: 14980/20392 cut-off events. [2024-06-28 02:05:02,231 INFO L125 PetriNetUnfolderBase]: For 12352/12373 co-relation queries the response was YES. [2024-06-28 02:05:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51949 conditions, 20392 events. 14980/20392 cut-off events. For 12352/12373 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 116877 event pairs, 5827 based on Foata normal form. 17/20406 useless extension candidates. Maximal degree in co-relation 51934. Up to 19910 conditions per place. [2024-06-28 02:05:02,339 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 111 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-28 02:05:02,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 141 transitions, 706 flow [2024-06-28 02:05:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:05:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:05:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2024-06-28 02:05:02,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6461988304093568 [2024-06-28 02:05:02,345 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 237 flow. Second operand 6 states and 221 transitions. [2024-06-28 02:05:02,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 141 transitions, 706 flow [2024-06-28 02:05:02,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 706 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:05:02,358 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 336 flow [2024-06-28 02:05:02,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-06-28 02:05:02,359 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2024-06-28 02:05:02,359 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 336 flow [2024-06-28 02:05:02,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:02,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:02,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:02,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:05:02,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:02,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 26391423, now seen corresponding path program 1 times [2024-06-28 02:05:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137460823] [2024-06-28 02:05:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137460823] [2024-06-28 02:05:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137460823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:03,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:03,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:05:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679975450] [2024-06-28 02:05:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:03,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:05:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:05:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:05:03,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:03,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-28 02:05:03,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:03,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:07,455 INFO L124 PetriNetUnfolderBase]: 18108/25494 cut-off events. [2024-06-28 02:05:07,455 INFO L125 PetriNetUnfolderBase]: For 25113/25113 co-relation queries the response was YES. [2024-06-28 02:05:07,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68779 conditions, 25494 events. 18108/25494 cut-off events. For 25113/25113 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 155480 event pairs, 9035 based on Foata normal form. 3/25495 useless extension candidates. Maximal degree in co-relation 68759. Up to 24156 conditions per place. [2024-06-28 02:05:07,590 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 89 selfloop transitions, 12 changer transitions 0/109 dead transitions. [2024-06-28 02:05:07,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 665 flow [2024-06-28 02:05:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:05:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:05:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-06-28 02:05:07,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228070175438596 [2024-06-28 02:05:07,594 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 336 flow. Second operand 5 states and 149 transitions. [2024-06-28 02:05:07,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 665 flow [2024-06-28 02:05:07,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 619 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 02:05:07,610 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 407 flow [2024-06-28 02:05:07,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-28 02:05:07,611 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-06-28 02:05:07,612 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 407 flow [2024-06-28 02:05:07,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 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-28 02:05:07,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:07,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:07,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:05:07,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:07,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash -413313634, now seen corresponding path program 1 times [2024-06-28 02:05:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123619633] [2024-06-28 02:05:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123619633] [2024-06-28 02:05:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123619633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:05:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813034315] [2024-06-28 02:05:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:10,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:05:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:05:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:05:10,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:10,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:10,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:10,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:10,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:14,503 INFO L124 PetriNetUnfolderBase]: 18159/24604 cut-off events. [2024-06-28 02:05:14,503 INFO L125 PetriNetUnfolderBase]: For 35479/35479 co-relation queries the response was YES. [2024-06-28 02:05:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73770 conditions, 24604 events. 18159/24604 cut-off events. For 35479/35479 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 140877 event pairs, 7696 based on Foata normal form. 3/24604 useless extension candidates. Maximal degree in co-relation 73747. Up to 24113 conditions per place. [2024-06-28 02:05:14,645 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 118 selfloop transitions, 26 changer transitions 0/152 dead transitions. [2024-06-28 02:05:14,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 967 flow [2024-06-28 02:05:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:05:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:05:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-28 02:05:14,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-06-28 02:05:14,648 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 407 flow. Second operand 6 states and 192 transitions. [2024-06-28 02:05:14,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 967 flow [2024-06-28 02:05:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 152 transitions, 953 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 02:05:14,673 INFO L231 Difference]: Finished difference. Result has 82 places, 96 transitions, 608 flow [2024-06-28 02:05:14,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=82, PETRI_TRANSITIONS=96} [2024-06-28 02:05:14,674 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2024-06-28 02:05:14,674 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 608 flow [2024-06-28 02:05:14,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:14,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:14,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:14,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:05:14,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:14,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 794467136, now seen corresponding path program 2 times [2024-06-28 02:05:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872650629] [2024-06-28 02:05:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:16,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872650629] [2024-06-28 02:05:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872650629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:16,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:05:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354101690] [2024-06-28 02:05:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:16,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:05:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:05:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:05:17,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:17,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:17,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:17,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:17,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:20,789 INFO L124 PetriNetUnfolderBase]: 18150/24606 cut-off events. [2024-06-28 02:05:20,789 INFO L125 PetriNetUnfolderBase]: For 51834/51846 co-relation queries the response was YES. [2024-06-28 02:05:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80676 conditions, 24606 events. 18150/24606 cut-off events. For 51834/51846 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 141202 event pairs, 7709 based on Foata normal form. 13/24616 useless extension candidates. Maximal degree in co-relation 80648. Up to 24104 conditions per place. [2024-06-28 02:05:20,956 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 112 selfloop transitions, 28 changer transitions 0/148 dead transitions. [2024-06-28 02:05:20,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 148 transitions, 1033 flow [2024-06-28 02:05:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:05:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:05:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-06-28 02:05:20,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409356725146199 [2024-06-28 02:05:20,958 INFO L175 Difference]: Start difference. First operand has 82 places, 96 transitions, 608 flow. Second operand 6 states and 185 transitions. [2024-06-28 02:05:20,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 148 transitions, 1033 flow [2024-06-28 02:05:21,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1013 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-28 02:05:21,011 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 690 flow [2024-06-28 02:05:21,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2024-06-28 02:05:21,012 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 25 predicate places. [2024-06-28 02:05:21,012 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 690 flow [2024-06-28 02:05:21,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:21,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:21,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:21,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:05:21,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:21,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 756044682, now seen corresponding path program 1 times [2024-06-28 02:05:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699847696] [2024-06-28 02:05:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699847696] [2024-06-28 02:05:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699847696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:05:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493696335] [2024-06-28 02:05:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:22,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:05:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:05:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:05:22,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:22,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:22,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:22,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:22,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:26,574 INFO L124 PetriNetUnfolderBase]: 18135/25530 cut-off events. [2024-06-28 02:05:26,574 INFO L125 PetriNetUnfolderBase]: For 54776/54776 co-relation queries the response was YES. [2024-06-28 02:05:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81596 conditions, 25530 events. 18135/25530 cut-off events. For 54776/54776 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 156425 event pairs, 8225 based on Foata normal form. 6/25534 useless extension candidates. Maximal degree in co-relation 81564. Up to 24136 conditions per place. [2024-06-28 02:05:26,769 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 123 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2024-06-28 02:05:26,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 147 transitions, 1102 flow [2024-06-28 02:05:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:05:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:05:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-28 02:05:26,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-06-28 02:05:26,772 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 690 flow. Second operand 6 states and 180 transitions. [2024-06-28 02:05:26,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 147 transitions, 1102 flow [2024-06-28 02:05:26,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 147 transitions, 1070 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-28 02:05:26,816 INFO L231 Difference]: Finished difference. Result has 92 places, 103 transitions, 741 flow [2024-06-28 02:05:26,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=92, PETRI_TRANSITIONS=103} [2024-06-28 02:05:26,816 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 29 predicate places. [2024-06-28 02:05:26,817 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 741 flow [2024-06-28 02:05:26,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:26,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:26,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:05:26,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:26,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1942573342, now seen corresponding path program 1 times [2024-06-28 02:05:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281675549] [2024-06-28 02:05:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281675549] [2024-06-28 02:05:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281675549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:05:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19535267] [2024-06-28 02:05:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:30,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:05:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:05:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:05:30,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:30,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 741 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:30,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:30,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:34,066 INFO L124 PetriNetUnfolderBase]: 18229/24759 cut-off events. [2024-06-28 02:05:34,066 INFO L125 PetriNetUnfolderBase]: For 70490/70494 co-relation queries the response was YES. [2024-06-28 02:05:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85496 conditions, 24759 events. 18229/24759 cut-off events. For 70490/70494 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 143852 event pairs, 6858 based on Foata normal form. 9/24766 useless extension candidates. Maximal degree in co-relation 85462. Up to 24112 conditions per place. [2024-06-28 02:05:34,247 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 140 selfloop transitions, 32 changer transitions 0/180 dead transitions. [2024-06-28 02:05:34,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 180 transitions, 1311 flow [2024-06-28 02:05:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:05:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:05:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-06-28 02:05:34,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568922305764411 [2024-06-28 02:05:34,249 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 741 flow. Second operand 7 states and 227 transitions. [2024-06-28 02:05:34,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 180 transitions, 1311 flow [2024-06-28 02:05:34,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 180 transitions, 1260 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-28 02:05:34,296 INFO L231 Difference]: Finished difference. Result has 95 places, 108 transitions, 814 flow [2024-06-28 02:05:34,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=814, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2024-06-28 02:05:34,299 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 32 predicate places. [2024-06-28 02:05:34,299 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 814 flow [2024-06-28 02:05:34,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:34,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:34,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:34,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:05:34,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:34,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1341689544, now seen corresponding path program 2 times [2024-06-28 02:05:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870560617] [2024-06-28 02:05:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:37,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:37,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870560617] [2024-06-28 02:05:37,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870560617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:37,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:37,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:05:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355333011] [2024-06-28 02:05:37,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:05:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:05:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:05:37,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:37,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 814 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:37,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:37,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:37,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:42,204 INFO L124 PetriNetUnfolderBase]: 18280/24804 cut-off events. [2024-06-28 02:05:42,204 INFO L125 PetriNetUnfolderBase]: For 87975/87975 co-relation queries the response was YES. [2024-06-28 02:05:42,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92085 conditions, 24804 events. 18280/24804 cut-off events. For 87975/87975 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 142267 event pairs, 7228 based on Foata normal form. 3/24804 useless extension candidates. Maximal degree in co-relation 92050. Up to 24137 conditions per place. [2024-06-28 02:05:42,387 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 143 selfloop transitions, 41 changer transitions 0/192 dead transitions. [2024-06-28 02:05:42,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 192 transitions, 1545 flow [2024-06-28 02:05:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:05:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:05:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-06-28 02:05:42,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5664160401002506 [2024-06-28 02:05:42,389 INFO L175 Difference]: Start difference. First operand has 95 places, 108 transitions, 814 flow. Second operand 7 states and 226 transitions. [2024-06-28 02:05:42,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 192 transitions, 1545 flow [2024-06-28 02:05:42,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 192 transitions, 1453 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 02:05:42,451 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 999 flow [2024-06-28 02:05:42,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=999, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2024-06-28 02:05:42,451 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2024-06-28 02:05:42,451 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 999 flow [2024-06-28 02:05:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:42,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:42,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:42,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:05:42,452 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:42,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1141321044, now seen corresponding path program 3 times [2024-06-28 02:05:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663584578] [2024-06-28 02:05:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663584578] [2024-06-28 02:05:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663584578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:45,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:45,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:05:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969664156] [2024-06-28 02:05:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:45,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:05:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:05:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:05:45,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:45,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:45,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:45,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:45,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:49,442 INFO L124 PetriNetUnfolderBase]: 18271/24795 cut-off events. [2024-06-28 02:05:49,443 INFO L125 PetriNetUnfolderBase]: For 109946/109946 co-relation queries the response was YES. [2024-06-28 02:05:49,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97544 conditions, 24795 events. 18271/24795 cut-off events. For 109946/109946 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 142345 event pairs, 7247 based on Foata normal form. 3/24793 useless extension candidates. Maximal degree in co-relation 97506. Up to 24128 conditions per place. [2024-06-28 02:05:49,600 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 137 selfloop transitions, 42 changer transitions 0/187 dead transitions. [2024-06-28 02:05:49,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 187 transitions, 1538 flow [2024-06-28 02:05:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:05:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:05:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-06-28 02:05:49,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5488721804511278 [2024-06-28 02:05:49,603 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 999 flow. Second operand 7 states and 219 transitions. [2024-06-28 02:05:49,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 187 transitions, 1538 flow [2024-06-28 02:05:49,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 187 transitions, 1489 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-28 02:05:49,680 INFO L231 Difference]: Finished difference. Result has 104 places, 123 transitions, 1056 flow [2024-06-28 02:05:49,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1056, PETRI_PLACES=104, PETRI_TRANSITIONS=123} [2024-06-28 02:05:49,682 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 41 predicate places. [2024-06-28 02:05:49,682 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 123 transitions, 1056 flow [2024-06-28 02:05:49,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:49,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:49,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:05:49,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:49,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash 138890079, now seen corresponding path program 1 times [2024-06-28 02:05:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587321817] [2024-06-28 02:05:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:05:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:05:52,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:05:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587321817] [2024-06-28 02:05:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587321817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:05:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:05:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:05:52,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003184443] [2024-06-28 02:05:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:05:52,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:05:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:05:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:05:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:05:52,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:05:52,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 123 transitions, 1056 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:52,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:05:52,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:05:52,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:05:56,642 INFO L124 PetriNetUnfolderBase]: 18555/25199 cut-off events. [2024-06-28 02:05:56,643 INFO L125 PetriNetUnfolderBase]: For 119322/119322 co-relation queries the response was YES. [2024-06-28 02:05:56,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100884 conditions, 25199 events. 18555/25199 cut-off events. For 119322/119322 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 144806 event pairs, 7226 based on Foata normal form. 6/25202 useless extension candidates. Maximal degree in co-relation 100844. Up to 24504 conditions per place. [2024-06-28 02:05:56,885 INFO L140 encePairwiseOnDemand]: 41/57 looper letters, 168 selfloop transitions, 51 changer transitions 0/227 dead transitions. [2024-06-28 02:05:56,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 227 transitions, 1959 flow [2024-06-28 02:05:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:05:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:05:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2024-06-28 02:05:56,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-06-28 02:05:56,887 INFO L175 Difference]: Start difference. First operand has 104 places, 123 transitions, 1056 flow. Second operand 8 states and 256 transitions. [2024-06-28 02:05:56,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 227 transitions, 1959 flow [2024-06-28 02:05:56,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 227 transitions, 1862 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 02:05:56,999 INFO L231 Difference]: Finished difference. Result has 110 places, 147 transitions, 1386 flow [2024-06-28 02:05:56,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1386, PETRI_PLACES=110, PETRI_TRANSITIONS=147} [2024-06-28 02:05:57,000 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 47 predicate places. [2024-06-28 02:05:57,000 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 147 transitions, 1386 flow [2024-06-28 02:05:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:05:57,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:05:57,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:05:57,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:05:57,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:05:57,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:05:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2057356547, now seen corresponding path program 2 times [2024-06-28 02:05:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:05:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494092724] [2024-06-28 02:05:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:05:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:05:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:06:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:06:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:06:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494092724] [2024-06-28 02:06:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494092724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:06:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:06:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:06:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124428845] [2024-06-28 02:06:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:06:00,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:06:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:06:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:06:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:06:00,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:06:00,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 147 transitions, 1386 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:00,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:06:00,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:06:00,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:06:05,234 INFO L124 PetriNetUnfolderBase]: 18641/25317 cut-off events. [2024-06-28 02:06:05,234 INFO L125 PetriNetUnfolderBase]: For 143813/143813 co-relation queries the response was YES. [2024-06-28 02:06:05,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106884 conditions, 25317 events. 18641/25317 cut-off events. For 143813/143813 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 145795 event pairs, 7108 based on Foata normal form. 6/25320 useless extension candidates. Maximal degree in co-relation 106840. Up to 24544 conditions per place. [2024-06-28 02:06:05,432 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 162 selfloop transitions, 50 changer transitions 0/220 dead transitions. [2024-06-28 02:06:05,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 220 transitions, 2072 flow [2024-06-28 02:06:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:06:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:06:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-06-28 02:06:05,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538847117794486 [2024-06-28 02:06:05,435 INFO L175 Difference]: Start difference. First operand has 110 places, 147 transitions, 1386 flow. Second operand 7 states and 221 transitions. [2024-06-28 02:06:05,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 220 transitions, 2072 flow [2024-06-28 02:06:05,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 220 transitions, 1981 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-28 02:06:05,557 INFO L231 Difference]: Finished difference. Result has 114 places, 150 transitions, 1456 flow [2024-06-28 02:06:05,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1456, PETRI_PLACES=114, PETRI_TRANSITIONS=150} [2024-06-28 02:06:05,558 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 51 predicate places. [2024-06-28 02:06:05,558 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 150 transitions, 1456 flow [2024-06-28 02:06:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:05,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:06:05,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:06:05,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:06:05,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:06:05,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:06:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1021206497, now seen corresponding path program 3 times [2024-06-28 02:06:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:06:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524335833] [2024-06-28 02:06:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:06:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:06:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:06:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:06:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:06:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524335833] [2024-06-28 02:06:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524335833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:06:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:06:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:06:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752920545] [2024-06-28 02:06:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:06:08,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:06:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:06:08,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:06:08,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:06:08,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:06:08,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 150 transitions, 1456 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:08,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:06:08,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:06:08,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:06:13,489 INFO L124 PetriNetUnfolderBase]: 18727/25453 cut-off events. [2024-06-28 02:06:13,490 INFO L125 PetriNetUnfolderBase]: For 167956/167968 co-relation queries the response was YES. [2024-06-28 02:06:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111302 conditions, 25453 events. 18727/25453 cut-off events. For 167956/167968 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 146533 event pairs, 7144 based on Foata normal form. 16/25465 useless extension candidates. Maximal degree in co-relation 111257. Up to 24724 conditions per place. [2024-06-28 02:06:13,726 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 168 selfloop transitions, 47 changer transitions 0/223 dead transitions. [2024-06-28 02:06:13,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 223 transitions, 2170 flow [2024-06-28 02:06:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:06:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:06:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2024-06-28 02:06:13,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2024-06-28 02:06:13,729 INFO L175 Difference]: Start difference. First operand has 114 places, 150 transitions, 1456 flow. Second operand 7 states and 217 transitions. [2024-06-28 02:06:13,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 223 transitions, 2170 flow [2024-06-28 02:06:13,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 223 transitions, 2059 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 02:06:13,926 INFO L231 Difference]: Finished difference. Result has 116 places, 153 transitions, 1502 flow [2024-06-28 02:06:13,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1502, PETRI_PLACES=116, PETRI_TRANSITIONS=153} [2024-06-28 02:06:13,927 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 53 predicate places. [2024-06-28 02:06:13,927 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 153 transitions, 1502 flow [2024-06-28 02:06:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:13,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:06:13,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:06:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:06:13,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:06:13,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:06:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 709512937, now seen corresponding path program 4 times [2024-06-28 02:06:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:06:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354968737] [2024-06-28 02:06:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:06:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:06:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:06:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:06:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:06:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354968737] [2024-06-28 02:06:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354968737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:06:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:06:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:06:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976532480] [2024-06-28 02:06:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:06:17,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:06:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:06:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:06:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:06:17,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:06:17,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 153 transitions, 1502 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:17,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:06:17,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:06:17,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:06:22,251 INFO L124 PetriNetUnfolderBase]: 18712/25432 cut-off events. [2024-06-28 02:06:22,251 INFO L125 PetriNetUnfolderBase]: For 192599/192611 co-relation queries the response was YES. [2024-06-28 02:06:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114634 conditions, 25432 events. 18712/25432 cut-off events. For 192599/192611 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 146587 event pairs, 6557 based on Foata normal form. 16/25444 useless extension candidates. Maximal degree in co-relation 114588. Up to 24425 conditions per place. [2024-06-28 02:06:22,457 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 160 selfloop transitions, 60 changer transitions 0/228 dead transitions. [2024-06-28 02:06:22,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 228 transitions, 2272 flow [2024-06-28 02:06:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:06:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:06:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-06-28 02:06:22,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5463659147869674 [2024-06-28 02:06:22,459 INFO L175 Difference]: Start difference. First operand has 116 places, 153 transitions, 1502 flow. Second operand 7 states and 218 transitions. [2024-06-28 02:06:22,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 228 transitions, 2272 flow [2024-06-28 02:06:22,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 228 transitions, 2157 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 02:06:22,608 INFO L231 Difference]: Finished difference. Result has 119 places, 159 transitions, 1652 flow [2024-06-28 02:06:22,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1652, PETRI_PLACES=119, PETRI_TRANSITIONS=159} [2024-06-28 02:06:22,609 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 56 predicate places. [2024-06-28 02:06:22,609 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 159 transitions, 1652 flow [2024-06-28 02:06:22,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:22,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:06:22,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:06:22,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:06:22,610 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:06:22,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:06:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1941275593, now seen corresponding path program 1 times [2024-06-28 02:06:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:06:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861075463] [2024-06-28 02:06:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:06:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:06:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:06:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:06:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:06:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861075463] [2024-06-28 02:06:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861075463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:06:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:06:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:06:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914924435] [2024-06-28 02:06:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:06:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:06:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:06:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:06:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:06:26,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:06:26,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 159 transitions, 1652 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:26,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:06:26,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:06:26,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:06:32,938 INFO L124 PetriNetUnfolderBase]: 19892/27096 cut-off events. [2024-06-28 02:06:32,938 INFO L125 PetriNetUnfolderBase]: For 257326/257330 co-relation queries the response was YES. [2024-06-28 02:06:33,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129791 conditions, 27096 events. 19892/27096 cut-off events. For 257326/257330 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 158633 event pairs, 5552 based on Foata normal form. 34/27128 useless extension candidates. Maximal degree in co-relation 129743. Up to 25183 conditions per place. [2024-06-28 02:06:33,192 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 223 selfloop transitions, 50 changer transitions 0/281 dead transitions. [2024-06-28 02:06:33,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 281 transitions, 2778 flow [2024-06-28 02:06:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:06:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:06:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 300 transitions. [2024-06-28 02:06:33,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5847953216374269 [2024-06-28 02:06:33,195 INFO L175 Difference]: Start difference. First operand has 119 places, 159 transitions, 1652 flow. Second operand 9 states and 300 transitions. [2024-06-28 02:06:33,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 281 transitions, 2778 flow [2024-06-28 02:06:33,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 281 transitions, 2679 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-28 02:06:33,509 INFO L231 Difference]: Finished difference. Result has 126 places, 168 transitions, 1813 flow [2024-06-28 02:06:33,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1813, PETRI_PLACES=126, PETRI_TRANSITIONS=168} [2024-06-28 02:06:33,510 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 63 predicate places. [2024-06-28 02:06:33,510 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 168 transitions, 1813 flow [2024-06-28 02:06:33,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:33,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:06:33,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:06:33,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:06:33,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:06:33,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:06:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash 530982379, now seen corresponding path program 2 times [2024-06-28 02:06:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:06:33,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891423843] [2024-06-28 02:06:33,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:06:33,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:06:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:06:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:06:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:06:37,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891423843] [2024-06-28 02:06:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891423843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:06:37,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:06:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:06:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324628472] [2024-06-28 02:06:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:06:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:06:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:06:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:06:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:06:37,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:06:37,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 168 transitions, 1813 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:06:37,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:06:37,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:06:37,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand