./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.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/safe016_rmo.opt.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/safe016_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_rmo.opt.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:02:59,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:02:59,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:02:59,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:02:59,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:02:59,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:02:59,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:02:59,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:02:59,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:02:59,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:02:59,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:02:59,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:02:59,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:02:59,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:02:59,859 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:02:59,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:02:59,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:02:59,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:02:59,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:02:59,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:02:59,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:02:59,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:02:59,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:02:59,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:02:59,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:02:59,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:02:59,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:02:59,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:02:59,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:02:59,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:02:59,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:02:59,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:02:59,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:02:59,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:02:59,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:02:59,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:02:59,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:02:59,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:02:59,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:02:59,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:02:59,865 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:02:59,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:02:59,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:02:59,866 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:03:00,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:03:00,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:03:00,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:03:00,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:03:00,114 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:03:00,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2024-06-28 02:03:01,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:03:01,433 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:03:01,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2024-06-28 02:03:01,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce6ac183/e4ad399ded124ea388beeaa3cd3bbfa3/FLAG901144779 [2024-06-28 02:03:01,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce6ac183/e4ad399ded124ea388beeaa3cd3bbfa3 [2024-06-28 02:03:01,470 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:03:01,470 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:03:01,472 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/safe016_rmo.opt.yml/witness.yml [2024-06-28 02:03:01,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:03:01,692 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:03:01,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:03:01,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:03:01,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:03:01,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:03:01" (1/2) ... [2024-06-28 02:03:01,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c878ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:03:01, skipping insertion in model container [2024-06-28 02:03:01,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:03:01" (1/2) ... [2024-06-28 02:03:01,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10d63306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:03:01, skipping insertion in model container [2024-06-28 02:03:01,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:03:01" (2/2) ... [2024-06-28 02:03:01,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c878ce0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:01, skipping insertion in model container [2024-06-28 02:03:01,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:03:01" (2/2) ... [2024-06-28 02:03:01,704 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:03:01,848 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:03:01,850 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 == 0) && x$w_buff0_used == (_Bool)0) && x$w_buff1 == 0) && x$w_buff1_used == (_Bool)0) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0) [2024-06-28 02:03:01,850 INFO L97 edCorrectnessWitness]: Location invariant before [L863-L863] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 == 0) && x$w_buff0_used == (_Bool)0) && x$w_buff1 == 0) && x$w_buff1_used == (_Bool)0) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0) [2024-06-28 02:03:01,850 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 == 0) && x$w_buff0_used == (_Bool)0) && x$w_buff1 == 0) && x$w_buff1_used == (_Bool)0) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0) [2024-06-28 02:03:01,850 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p2_EAX$flush_delayed == (_Bool)0) && __unbuffered_p2_EAX$mem_tmp == 0) && __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p2_EAX$w_buff0 == 0) && __unbuffered_p2_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p2_EAX$w_buff1 == 0) && __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff0_thd4 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$r_buff1_thd4 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 == 0) && x$w_buff0_used == (_Bool)0) && x$w_buff1 == 0) && x$w_buff1_used == (_Bool)0) && (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (__unbuffered_p2_EAX$read_delayed_var == & x && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0) [2024-06-28 02:03:01,851 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:03:01,851 INFO L106 edCorrectnessWitness]: ghost_update [L861-L861] multithreaded = 1; [2024-06-28 02:03:01,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:03:02,079 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/safe016_rmo.opt.i[949,962] [2024-06-28 02:03:02,242 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:03:02,266 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:03:02,297 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/safe016_rmo.opt.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:03:02,446 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:03:02,493 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:03:02,493 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02 WrapperNode [2024-06-28 02:03:02,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:03:02,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:03:02,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:03:02,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:03:02,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,568 INFO L138 Inliner]: procedures = 176, calls = 121, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 325 [2024-06-28 02:03:02,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:03:02,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:03:02,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:03:02,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:03:02,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,607 INFO L175 MemorySlicer]: Split 76 memory accesses to 2 slices as follows [2, 74]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-06-28 02:03:02,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:03:02,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:03:02,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:03:02,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:03:02,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (1/1) ... [2024-06-28 02:03:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:03:02,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:03:02,702 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:03:02,721 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:03:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:03:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:03:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:03:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:03:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:03:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:03:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:03:02,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:03:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:03:02,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:03:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:03:02,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:03:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:03:02,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:03:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:03:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:03:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:03:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:03:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:03:02,739 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:03:02,885 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:03:02,887 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:03:03,469 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:03:03,469 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:03:04,013 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:03:04,013 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:03:04,013 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:03:04 BoogieIcfgContainer [2024-06-28 02:03:04,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:03:04,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:03:04,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:03:04,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:03:04,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:03:01" (1/4) ... [2024-06-28 02:03:04,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7f9910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:03:04, skipping insertion in model container [2024-06-28 02:03:04,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:03:01" (2/4) ... [2024-06-28 02:03:04,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7f9910 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:03:04, skipping insertion in model container [2024-06-28 02:03:04,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:03:02" (3/4) ... [2024-06-28 02:03:04,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7f9910 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:03:04, skipping insertion in model container [2024-06-28 02:03:04,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:03:04" (4/4) ... [2024-06-28 02:03:04,021 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2024-06-28 02:03:04,034 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:03:04,035 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 02:03:04,035 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:03:04,099 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:03:04,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:03:04,163 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-28 02:03:04,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:03:04,167 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 69 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:03:04,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:03:04,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 112 flow [2024-06-28 02:03:04,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:03:04,192 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;@aab5d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:03:04,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 02:03:04,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:03:04,198 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:03:04,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:03:04,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:04,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:03:04,199 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:03:04,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 981942703, now seen corresponding path program 1 times [2024-06-28 02:03:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:04,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359321030] [2024-06-28 02:03:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:06,143 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:03:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:06,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359321030] [2024-06-28 02:03:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359321030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:06,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:03:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969540621] [2024-06-28 02:03:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:06,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:03:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:03:06,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:03:06,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:06,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:03:06,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:06,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:06,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:10,400 INFO L124 PetriNetUnfolderBase]: 23111/32264 cut-off events. [2024-06-28 02:03:10,400 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-06-28 02:03:10,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63390 conditions, 32264 events. 23111/32264 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 196030 event pairs, 16822 based on Foata normal form. 0/31335 useless extension candidates. Maximal degree in co-relation 63377. Up to 30740 conditions per place. [2024-06-28 02:03:10,575 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 58 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-06-28 02:03:10,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 293 flow [2024-06-28 02:03:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:03:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:03:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-06-28 02:03:10,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6257309941520468 [2024-06-28 02:03:10,587 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 112 flow. Second operand 3 states and 107 transitions. [2024-06-28 02:03:10,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 293 flow [2024-06-28 02:03:10,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:03:10,596 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 154 flow [2024-06-28 02:03:10,597 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:03:10,600 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-06-28 02:03:10,600 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 154 flow [2024-06-28 02:03:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:03:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:03:10,601 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:03:10,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 53388300, now seen corresponding path program 1 times [2024-06-28 02:03:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017123916] [2024-06-28 02:03:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:12,714 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:03:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:12,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017123916] [2024-06-28 02:03:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017123916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:12,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:12,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:03:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790912575] [2024-06-28 02:03:12,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:12,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:03:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:12,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:03:12,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:03:12,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-06-28 02:03:12,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:03:12,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:12,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-06-28 02:03:12,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:17,585 INFO L124 PetriNetUnfolderBase]: 28211/39268 cut-off events. [2024-06-28 02:03:17,585 INFO L125 PetriNetUnfolderBase]: For 6117/6136 co-relation queries the response was YES. [2024-06-28 02:03:17,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85779 conditions, 39268 events. 28211/39268 cut-off events. For 6117/6136 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 237419 event pairs, 12263 based on Foata normal form. 26/39283 useless extension candidates. Maximal degree in co-relation 85767. Up to 36847 conditions per place. [2024-06-28 02:03:17,808 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 85 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2024-06-28 02:03:17,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 500 flow [2024-06-28 02:03:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:03:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:03:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-06-28 02:03:17,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-06-28 02:03:17,815 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 154 flow. Second operand 4 states and 150 transitions. [2024-06-28 02:03:17,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 500 flow [2024-06-28 02:03:17,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:03:17,831 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 264 flow [2024-06-28 02:03:17,832 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2024-06-28 02:03:17,837 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-06-28 02:03:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 264 flow [2024-06-28 02:03:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:03:17,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:17,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:17,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:03:17,839 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:03:17,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -233380725, now seen corresponding path program 1 times [2024-06-28 02:03:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768448003] [2024-06-28 02:03:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:21,173 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:03:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768448003] [2024-06-28 02:03:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768448003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286205410] [2024-06-28 02:03:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:21,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:21,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-06-28 02:03:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:21,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:21,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-06-28 02:03:21,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:25,859 INFO L124 PetriNetUnfolderBase]: 28659/39912 cut-off events. [2024-06-28 02:03:25,860 INFO L125 PetriNetUnfolderBase]: For 22667/22746 co-relation queries the response was YES. [2024-06-28 02:03:25,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100050 conditions, 39912 events. 28659/39912 cut-off events. For 22667/22746 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 242042 event pairs, 10069 based on Foata normal form. 84/39985 useless extension candidates. Maximal degree in co-relation 100035. Up to 36925 conditions per place. [2024-06-28 02:03:26,082 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 103 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-28 02:03:26,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 684 flow [2024-06-28 02:03:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:03:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:03:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-06-28 02:03:26,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6456140350877193 [2024-06-28 02:03:26,084 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 264 flow. Second operand 5 states and 184 transitions. [2024-06-28 02:03:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 684 flow [2024-06-28 02:03:26,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 131 transitions, 676 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 02:03:26,089 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 336 flow [2024-06-28 02:03:26,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=336, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2024-06-28 02:03:26,090 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2024-06-28 02:03:26,090 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 336 flow [2024-06-28 02:03:26,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:26,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:26,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:26,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:03:26,091 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:03:26,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -803112439, now seen corresponding path program 1 times [2024-06-28 02:03:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:26,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774129613] [2024-06-28 02:03:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:28,027 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:03:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774129613] [2024-06-28 02:03:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774129613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:03:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710096727] [2024-06-28 02:03:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:28,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:03:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:28,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:03:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:03:28,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-06-28 02:03:28,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:03:28,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:28,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-06-28 02:03:28,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:33,062 INFO L124 PetriNetUnfolderBase]: 23613/32969 cut-off events. [2024-06-28 02:03:33,062 INFO L125 PetriNetUnfolderBase]: For 32921/32967 co-relation queries the response was YES. [2024-06-28 02:03:33,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89755 conditions, 32969 events. 23613/32969 cut-off events. For 32921/32967 co-relation queries the response was YES. Maximal size of possible extension queue 1183. Compared 200656 event pairs, 10516 based on Foata normal form. 46/33004 useless extension candidates. Maximal degree in co-relation 89736. Up to 31036 conditions per place. [2024-06-28 02:03:33,274 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 79 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2024-06-28 02:03:33,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 608 flow [2024-06-28 02:03:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:03:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:03:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-06-28 02:03:33,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 02:03:33,277 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 336 flow. Second operand 5 states and 152 transitions. [2024-06-28 02:03:33,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 608 flow [2024-06-28 02:03:33,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 562 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 02:03:33,289 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 340 flow [2024-06-28 02:03:33,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2024-06-28 02:03:33,290 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2024-06-28 02:03:33,291 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 340 flow [2024-06-28 02:03:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:03:33,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:33,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:33,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:03:33,292 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:03:33,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -13340922, now seen corresponding path program 1 times [2024-06-28 02:03:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441566215] [2024-06-28 02:03:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:36,474 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:03:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441566215] [2024-06-28 02:03:36,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441566215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:36,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:36,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276592544] [2024-06-28 02:03:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:36,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-06-28 02:03:36,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:03:36,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:36,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-06-28 02:03:36,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:41,239 INFO L124 PetriNetUnfolderBase]: 24014/33532 cut-off events. [2024-06-28 02:03:41,240 INFO L125 PetriNetUnfolderBase]: For 36823/36869 co-relation queries the response was YES. [2024-06-28 02:03:41,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92147 conditions, 33532 events. 24014/33532 cut-off events. For 36823/36869 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 204689 event pairs, 9451 based on Foata normal form. 70/33591 useless extension candidates. Maximal degree in co-relation 92126. Up to 31109 conditions per place. [2024-06-28 02:03:41,384 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 98 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-06-28 02:03:41,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 127 transitions, 734 flow [2024-06-28 02:03:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-06-28 02:03:41,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5467836257309941 [2024-06-28 02:03:41,387 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 340 flow. Second operand 6 states and 187 transitions. [2024-06-28 02:03:41,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 127 transitions, 734 flow [2024-06-28 02:03:41,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 698 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:03:41,400 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 398 flow [2024-06-28 02:03:41,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2024-06-28 02:03:41,400 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-06-28 02:03:41,401 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 398 flow [2024-06-28 02:03:41,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:03:41,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:41,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:41,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:03:41,401 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:41,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -890227468, now seen corresponding path program 1 times [2024-06-28 02:03:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489457030] [2024-06-28 02:03:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:43,956 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:03:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489457030] [2024-06-28 02:03:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489457030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:43,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:03:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474579896] [2024-06-28 02:03:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:43,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:03:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:03:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:03:43,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-06-28 02:03:43,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:03:43,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:43,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-06-28 02:03:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:48,382 INFO L124 PetriNetUnfolderBase]: 24007/33510 cut-off events. [2024-06-28 02:03:48,382 INFO L125 PetriNetUnfolderBase]: For 52647/52647 co-relation queries the response was YES. [2024-06-28 02:03:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97951 conditions, 33510 events. 24007/33510 cut-off events. For 52647/52647 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 203913 event pairs, 12674 based on Foata normal form. 2/33509 useless extension candidates. Maximal degree in co-relation 97929. Up to 31961 conditions per place. [2024-06-28 02:03:48,586 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 90 selfloop transitions, 14 changer transitions 0/111 dead transitions. [2024-06-28 02:03:48,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 744 flow [2024-06-28 02:03:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:03:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:03:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-06-28 02:03:48,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982456140350877 [2024-06-28 02:03:48,588 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 398 flow. Second operand 5 states and 142 transitions. [2024-06-28 02:03:48,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 744 flow [2024-06-28 02:03:48,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 690 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 02:03:48,624 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 465 flow [2024-06-28 02:03:48,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2024-06-28 02:03:48,624 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 14 predicate places. [2024-06-28 02:03:48,625 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 465 flow [2024-06-28 02:03:48,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:03:48,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:48,625 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:03:48,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:03:48,625 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:03:48,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1079884117, now seen corresponding path program 1 times [2024-06-28 02:03:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211528285] [2024-06-28 02:03:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211528285] [2024-06-28 02:03:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211528285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:03:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939999490] [2024-06-28 02:03:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:51,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:03:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:03:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:03:51,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 57 [2024-06-28 02:03:51,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 465 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:03:51,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:51,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 57 [2024-06-28 02:03:51,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:57,005 INFO L124 PetriNetUnfolderBase]: 28977/40363 cut-off events. [2024-06-28 02:03:57,006 INFO L125 PetriNetUnfolderBase]: For 89503/89606 co-relation queries the response was YES. [2024-06-28 02:03:57,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123746 conditions, 40363 events. 28977/40363 cut-off events. For 89503/89606 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 245139 event pairs, 7009 based on Foata normal form. 81/40424 useless extension candidates. Maximal degree in co-relation 123722. Up to 36323 conditions per place. [2024-06-28 02:03:57,550 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 109 selfloop transitions, 28 changer transitions 0/143 dead transitions. [2024-06-28 02:03:57,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 959 flow [2024-06-28 02:03:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-06-28 02:03:57,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321637426900585 [2024-06-28 02:03:57,553 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 465 flow. Second operand 6 states and 182 transitions. [2024-06-28 02:03:57,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 959 flow [2024-06-28 02:03:57,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 143 transitions, 939 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-28 02:03:57,739 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 585 flow [2024-06-28 02:03:57,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2024-06-28 02:03:57,739 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2024-06-28 02:03:57,740 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 585 flow [2024-06-28 02:03:57,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:03:57,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:57,740 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:03:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:03:57,740 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:03:57,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -512590133, now seen corresponding path program 1 times [2024-06-28 02:03:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827032208] [2024-06-28 02:03:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:04:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:04:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:04:00,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827032208] [2024-06-28 02:04:00,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827032208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:04:00,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:04:00,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:04:00,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632940937] [2024-06-28 02:04:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:04:00,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:04:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:04:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:04:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:04:00,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 57 [2024-06-28 02:04:00,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:00,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:04:00,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 57 [2024-06-28 02:04:00,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:04:06,000 INFO L124 PetriNetUnfolderBase]: 28923/40285 cut-off events. [2024-06-28 02:04:06,000 INFO L125 PetriNetUnfolderBase]: For 113568/113677 co-relation queries the response was YES. [2024-06-28 02:04:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129055 conditions, 40285 events. 28923/40285 cut-off events. For 113568/113677 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 244326 event pairs, 6979 based on Foata normal form. 81/40346 useless extension candidates. Maximal degree in co-relation 129028. Up to 36299 conditions per place. [2024-06-28 02:04:06,245 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 106 selfloop transitions, 28 changer transitions 0/140 dead transitions. [2024-06-28 02:04:06,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 140 transitions, 963 flow [2024-06-28 02:04:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:04:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:04:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-06-28 02:04:06,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233918128654971 [2024-06-28 02:04:06,247 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 585 flow. Second operand 6 states and 179 transitions. [2024-06-28 02:04:06,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 140 transitions, 963 flow [2024-06-28 02:04:06,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 140 transitions, 915 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-28 02:04:06,558 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 587 flow [2024-06-28 02:04:06,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2024-06-28 02:04:06,559 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 22 predicate places. [2024-06-28 02:04:06,559 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 587 flow [2024-06-28 02:04:06,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:06,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:04:06,560 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:04:06,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:04:06,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:04:06,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:04:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1812052439, now seen corresponding path program 1 times [2024-06-28 02:04:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:04:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353150436] [2024-06-28 02:04:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:04:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:04:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat