./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_power.oepc-thin000_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_power.oepc-thin000_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:54:20,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:54:20,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:54:20,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:54:20,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:54:20,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:54:20,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:54:20,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:54:20,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:54:20,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:54:20,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:54:20,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:54:20,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:54:20,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:54:20,687 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:54:20,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:54:20,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:54:20,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:54:20,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:54:20,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:54:20,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:54:20,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:54:20,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:54:20,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:54:20,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:54:20,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:54:20,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:54:20,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:54:20,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:54:20,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:54:20,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:54:20,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:54:20,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:20,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:54:20,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:54:20,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:54:20,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:54:20,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:54:20,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:54:20,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:54:20,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:54:20,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:54:20,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:54:20,696 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 01:54:20,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:54:20,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:54:20,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:54:20,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:54:20,977 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:54:20,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-28 01:54:22,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:54:22,415 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:54:22,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-28 01:54:22,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c3d625b/b6e33e3f5b7a428aa9906078095546ec/FLAG9a3e91016 [2024-06-28 01:54:22,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c3d625b/b6e33e3f5b7a428aa9906078095546ec [2024-06-28 01:54:22,454 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:54:22,454 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:54:22,455 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/safe006_power.oepc-thin000_power.oepc.yml/witness.yml [2024-06-28 01:54:22,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:54:22,679 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:54:22,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:22,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:54:22,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:54:22,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:22" (1/2) ... [2024-06-28 01:54:22,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c1ef2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:22, skipping insertion in model container [2024-06-28 01:54:22,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:22" (1/2) ... [2024-06-28 01:54:22,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@270a964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:22, skipping insertion in model container [2024-06-28 01:54:22,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:54:22" (2/2) ... [2024-06-28 01:54:22,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c1ef2b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:22, skipping insertion in model container [2024-06-28 01:54:22,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:54:22" (2/2) ... [2024-06-28 01:54:22,690 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:54:22,791 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:54:22,792 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:54:22,793 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-28 01:54:22,793 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:54:22,793 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-28 01:54:22,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:54:23,086 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/safe006_power.oepc-thin000_power.oepc.i[1014,1027] [2024-06-28 01:54:23,271 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:23,280 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:54:23,328 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/safe006_power.oepc-thin000_power.oepc.i[1014,1027] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:54:23,425 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:23,473 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:54:23,473 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:23 WrapperNode [2024-06-28 01:54:23,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:23,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:23,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:54:23,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:54:23,482 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,514 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,556 INFO L138 Inliner]: procedures = 174, calls = 64, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2024-06-28 01:54:23,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:23,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:54:23,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:54:23,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:54:23,568 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,568 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,591 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,608 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 01:54:23,617 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,617 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,633 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,643 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,645 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,647 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:54:23,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:54:23,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:54:23,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:54:23,656 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 01:54:23" (1/1) ... [2024-06-28 01:54:23,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:54:23,689 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 01:54:23,714 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 01:54:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:54:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:54:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:54:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:54:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:54:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:54:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:54:23,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:54:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:54:23,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:54:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:54:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:54:23,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:54:23,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:54:23,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:54:23,734 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 01:54:23,890 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:54:23,892 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:54:24,344 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:54:24,344 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:54:24,762 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:54:24,762 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:54:24,763 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:54:24 BoogieIcfgContainer [2024-06-28 01:54:24,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:54:24,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:54:24,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:54:24,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:54:24,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:54:22" (1/4) ... [2024-06-28 01:54:24,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d27a5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:54:22" (2/4) ... [2024-06-28 01:54:24,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d27a5e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,771 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 01:54:23" (3/4) ... [2024-06-28 01:54:24,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d27a5e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:54:24" (4/4) ... [2024-06-28 01:54:24,772 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-06-28 01:54:24,790 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:54:24,791 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:54:24,791 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:54:24,850 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:54:24,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:54:24,926 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 01:54:24,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:24,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-28 01:54:24,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:54:24,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-28 01:54:24,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:54:24,961 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;@5924c8ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:54:24,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:54:24,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:54:24,970 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 01:54:24,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:24,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:24,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:54:24,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:24,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 627559645, now seen corresponding path program 1 times [2024-06-28 01:54:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490228743] [2024-06-28 01:54:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490228743] [2024-06-28 01:54:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490228743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:54:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680878934] [2024-06-28 01:54:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:26,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:54:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:26,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:54:26,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:54:26,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:54:26,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 01:54:26,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:26,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:54:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:27,108 INFO L124 PetriNetUnfolderBase]: 353/667 cut-off events. [2024-06-28 01:54:27,108 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 01:54:27,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 667 events. 353/667 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3107 event pairs, 175 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 1274. Up to 592 conditions per place. [2024-06-28 01:54:27,115 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-28 01:54:27,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 163 flow [2024-06-28 01:54:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:54:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:54:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-28 01:54:27,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-06-28 01:54:27,127 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 66 flow. Second operand 3 states and 67 transitions. [2024-06-28 01:54:27,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 163 flow [2024-06-28 01:54:27,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:54:27,132 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2024-06-28 01:54:27,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-06-28 01:54:27,137 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-28 01:54:27,138 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2024-06-28 01:54:27,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 01:54:27,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:27,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:27,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:54:27,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:27,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1789643406, now seen corresponding path program 1 times [2024-06-28 01:54:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636314215] [2024-06-28 01:54:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:29,410 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 01:54:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636314215] [2024-06-28 01:54:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636314215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:54:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894391065] [2024-06-28 01:54:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:29,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:54:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:29,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:54:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:54:29,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:54:29,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 01:54:29,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:29,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:54:29,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:29,828 INFO L124 PetriNetUnfolderBase]: 350/625 cut-off events. [2024-06-28 01:54:29,829 INFO L125 PetriNetUnfolderBase]: For 107/111 co-relation queries the response was YES. [2024-06-28 01:54:29,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 625 events. 350/625 cut-off events. For 107/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2828 event pairs, 100 based on Foata normal form. 4/627 useless extension candidates. Maximal degree in co-relation 1386. Up to 562 conditions per place. [2024-06-28 01:54:29,834 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-28 01:54:29,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 256 flow [2024-06-28 01:54:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:54:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:54:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-28 01:54:29,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-28 01:54:29,836 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 91 transitions. [2024-06-28 01:54:29,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 256 flow [2024-06-28 01:54:29,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:54:29,838 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2024-06-28 01:54:29,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 01:54:29,839 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-28 01:54:29,840 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2024-06-28 01:54:29,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 01:54:29,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:29,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:29,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:54:29,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:29,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -355627820, now seen corresponding path program 1 times [2024-06-28 01:54:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060180873] [2024-06-28 01:54:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:32,319 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 01:54:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060180873] [2024-06-28 01:54:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060180873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:54:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952472947] [2024-06-28 01:54:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:32,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:54:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:54:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:54:32,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:54:32,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:32,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:32,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:54:32,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:33,024 INFO L124 PetriNetUnfolderBase]: 419/734 cut-off events. [2024-06-28 01:54:33,024 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-06-28 01:54:33,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 734 events. 419/734 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3326 event pairs, 73 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 1840. Up to 649 conditions per place. [2024-06-28 01:54:33,031 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-28 01:54:33,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 384 flow [2024-06-28 01:54:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:54:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:54:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-28 01:54:33,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-28 01:54:33,034 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 135 flow. Second operand 5 states and 110 transitions. [2024-06-28 01:54:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 384 flow [2024-06-28 01:54:33,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 01:54:33,039 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 205 flow [2024-06-28 01:54:33,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-28 01:54:33,040 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-28 01:54:33,041 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 205 flow [2024-06-28 01:54:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:33,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:33,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:33,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:54:33,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:33,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 121941413, now seen corresponding path program 1 times [2024-06-28 01:54:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923560597] [2024-06-28 01:54:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:36,139 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 01:54:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923560597] [2024-06-28 01:54:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923560597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:36,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:36,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:54:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926230426] [2024-06-28 01:54:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:36,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:54:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:36,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:54:36,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:54:36,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:54:36,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 01:54:36,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:36,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:54:36,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:36,898 INFO L124 PetriNetUnfolderBase]: 415/726 cut-off events. [2024-06-28 01:54:36,898 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-06-28 01:54:36,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 726 events. 415/726 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3296 event pairs, 24 based on Foata normal form. 4/729 useless extension candidates. Maximal degree in co-relation 2036. Up to 595 conditions per place. [2024-06-28 01:54:36,903 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-06-28 01:54:36,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 449 flow [2024-06-28 01:54:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-28 01:54:36,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-28 01:54:36,908 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 205 flow. Second operand 6 states and 126 transitions. [2024-06-28 01:54:36,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 449 flow [2024-06-28 01:54:36,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 01:54:36,915 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 219 flow [2024-06-28 01:54:36,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-28 01:54:36,916 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-28 01:54:36,917 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 219 flow [2024-06-28 01:54:36,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 01:54:36,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:36,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:54:36,918 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:36,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1749128518, now seen corresponding path program 1 times [2024-06-28 01:54:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42347548] [2024-06-28 01:54:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:38,674 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 01:54:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:38,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42347548] [2024-06-28 01:54:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42347548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:54:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370777536] [2024-06-28 01:54:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:54:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:54:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:54:38,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:38,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 01:54:38,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:38,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:38,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:39,291 INFO L124 PetriNetUnfolderBase]: 411/766 cut-off events. [2024-06-28 01:54:39,291 INFO L125 PetriNetUnfolderBase]: For 904/904 co-relation queries the response was YES. [2024-06-28 01:54:39,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 766 events. 411/766 cut-off events. For 904/904 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3591 event pairs, 114 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 2173. Up to 650 conditions per place. [2024-06-28 01:54:39,297 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2024-06-28 01:54:39,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 384 flow [2024-06-28 01:54:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:54:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:54:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-28 01:54:39,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:54:39,299 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 219 flow. Second operand 5 states and 87 transitions. [2024-06-28 01:54:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 384 flow [2024-06-28 01:54:39,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 358 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 01:54:39,302 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 238 flow [2024-06-28 01:54:39,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-28 01:54:39,303 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-28 01:54:39,304 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 238 flow [2024-06-28 01:54:39,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 01:54:39,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:39,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:39,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:54:39,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:39,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash 385881785, now seen corresponding path program 1 times [2024-06-28 01:54:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170923974] [2024-06-28 01:54:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:42,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170923974] [2024-06-28 01:54:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170923974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:42,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117198829] [2024-06-28 01:54:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:42,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:42,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:42,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:42,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:42,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:42,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:42,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:43,383 INFO L124 PetriNetUnfolderBase]: 426/755 cut-off events. [2024-06-28 01:54:43,384 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2024-06-28 01:54:43,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291 conditions, 755 events. 426/755 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3555 event pairs, 73 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 2266. Up to 589 conditions per place. [2024-06-28 01:54:43,393 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2024-06-28 01:54:43,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 536 flow [2024-06-28 01:54:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 01:54:43,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:54:43,396 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 238 flow. Second operand 7 states and 133 transitions. [2024-06-28 01:54:43,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 536 flow [2024-06-28 01:54:43,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 01:54:43,401 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 281 flow [2024-06-28 01:54:43,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-28 01:54:43,405 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2024-06-28 01:54:43,405 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 281 flow [2024-06-28 01:54:43,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:43,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:43,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:54:43,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:43,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1586930657, now seen corresponding path program 2 times [2024-06-28 01:54:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040259377] [2024-06-28 01:54:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:46,307 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 01:54:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040259377] [2024-06-28 01:54:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040259377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317573545] [2024-06-28 01:54:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:46,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:46,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:46,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:46,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:47,237 INFO L124 PetriNetUnfolderBase]: 456/809 cut-off events. [2024-06-28 01:54:47,238 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2024-06-28 01:54:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 809 events. 456/809 cut-off events. For 1387/1387 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3882 event pairs, 71 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 2611. Up to 667 conditions per place. [2024-06-28 01:54:47,245 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-28 01:54:47,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 567 flow [2024-06-28 01:54:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 01:54:47,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 01:54:47,247 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 281 flow. Second operand 7 states and 127 transitions. [2024-06-28 01:54:47,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 567 flow [2024-06-28 01:54:47,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 531 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:47,253 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 318 flow [2024-06-28 01:54:47,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-06-28 01:54:47,254 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-06-28 01:54:47,255 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 318 flow [2024-06-28 01:54:47,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:47,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:47,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:47,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:54:47,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:47,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash 386001941, now seen corresponding path program 1 times [2024-06-28 01:54:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372910280] [2024-06-28 01:54:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:50,065 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 01:54:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:50,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372910280] [2024-06-28 01:54:50,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372910280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:50,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:50,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307733417] [2024-06-28 01:54:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:50,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:50,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:50,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:50,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:50,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:50,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:50,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:50,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:51,018 INFO L124 PetriNetUnfolderBase]: 520/915 cut-off events. [2024-06-28 01:54:51,018 INFO L125 PetriNetUnfolderBase]: For 1628/1628 co-relation queries the response was YES. [2024-06-28 01:54:51,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 915 events. 520/915 cut-off events. For 1628/1628 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4403 event pairs, 80 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 2916. Up to 721 conditions per place. [2024-06-28 01:54:51,025 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 78 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-28 01:54:51,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 654 flow [2024-06-28 01:54:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:54:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:54:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:54:51,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 01:54:51,027 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 318 flow. Second operand 8 states and 147 transitions. [2024-06-28 01:54:51,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 654 flow [2024-06-28 01:54:51,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 623 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:51,032 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 373 flow [2024-06-28 01:54:51,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-28 01:54:51,035 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2024-06-28 01:54:51,035 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 373 flow [2024-06-28 01:54:51,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:51,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:51,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:51,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:54:51,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:51,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1934545567, now seen corresponding path program 3 times [2024-06-28 01:54:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338761304] [2024-06-28 01:54:51,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:53,516 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 01:54:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338761304] [2024-06-28 01:54:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338761304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215377325] [2024-06-28 01:54:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:53,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:53,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:53,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:53,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:53,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:53,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:53,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:54,515 INFO L124 PetriNetUnfolderBase]: 518/910 cut-off events. [2024-06-28 01:54:54,516 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-06-28 01:54:54,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 910 events. 518/910 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4378 event pairs, 81 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 3143. Up to 724 conditions per place. [2024-06-28 01:54:54,525 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2024-06-28 01:54:54,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 633 flow [2024-06-28 01:54:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 01:54:54,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-28 01:54:54,527 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 373 flow. Second operand 6 states and 115 transitions. [2024-06-28 01:54:54,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 633 flow [2024-06-28 01:54:54,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 605 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:54,532 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 394 flow [2024-06-28 01:54:54,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-28 01:54:54,534 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2024-06-28 01:54:54,534 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 394 flow [2024-06-28 01:54:54,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:54,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:54,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:54,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:54:54,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:54,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1934545753, now seen corresponding path program 2 times [2024-06-28 01:54:54,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763328505] [2024-06-28 01:54:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:56,782 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 01:54:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763328505] [2024-06-28 01:54:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763328505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:56,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:56,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148294054] [2024-06-28 01:54:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:56,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:56,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:57,503 INFO L124 PetriNetUnfolderBase]: 514/908 cut-off events. [2024-06-28 01:54:57,503 INFO L125 PetriNetUnfolderBase]: For 2378/2378 co-relation queries the response was YES. [2024-06-28 01:54:57,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 908 events. 514/908 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4356 event pairs, 81 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 3250. Up to 715 conditions per place. [2024-06-28 01:54:57,511 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 64 selfloop transitions, 19 changer transitions 0/88 dead transitions. [2024-06-28 01:54:57,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 628 flow [2024-06-28 01:54:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-28 01:54:57,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:54:57,513 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 394 flow. Second operand 6 states and 111 transitions. [2024-06-28 01:54:57,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 628 flow [2024-06-28 01:54:57,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 580 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:54:57,522 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 394 flow [2024-06-28 01:54:57,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-28 01:54:57,524 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2024-06-28 01:54:57,524 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 394 flow [2024-06-28 01:54:57,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:57,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:57,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:57,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:54:57,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:54:57,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1934782903, now seen corresponding path program 3 times [2024-06-28 01:54:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446188711] [2024-06-28 01:54:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:59,856 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 01:54:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446188711] [2024-06-28 01:54:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446188711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118868579] [2024-06-28 01:54:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:59,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:54:59,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:59,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:54:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:00,545 INFO L124 PetriNetUnfolderBase]: 516/913 cut-off events. [2024-06-28 01:55:00,546 INFO L125 PetriNetUnfolderBase]: For 2499/2502 co-relation queries the response was YES. [2024-06-28 01:55:00,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 913 events. 516/913 cut-off events. For 2499/2502 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4443 event pairs, 92 based on Foata normal form. 4/915 useless extension candidates. Maximal degree in co-relation 3271. Up to 643 conditions per place. [2024-06-28 01:55:00,552 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 66 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-28 01:55:00,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 668 flow [2024-06-28 01:55:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-28 01:55:00,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-28 01:55:00,554 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 394 flow. Second operand 6 states and 109 transitions. [2024-06-28 01:55:00,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 668 flow [2024-06-28 01:55:00,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 630 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:00,560 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 453 flow [2024-06-28 01:55:00,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-06-28 01:55:00,560 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-06-28 01:55:00,561 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 453 flow [2024-06-28 01:55:00,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:00,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:00,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:00,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:55:00,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:00,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1934791831, now seen corresponding path program 1 times [2024-06-28 01:55:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935394009] [2024-06-28 01:55:00,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:02,903 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 01:55:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935394009] [2024-06-28 01:55:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935394009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345342116] [2024-06-28 01:55:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:02,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:02,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:02,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:02,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:02,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:02,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:02,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:02,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:03,560 INFO L124 PetriNetUnfolderBase]: 513/945 cut-off events. [2024-06-28 01:55:03,560 INFO L125 PetriNetUnfolderBase]: For 2677/2677 co-relation queries the response was YES. [2024-06-28 01:55:03,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 945 events. 513/945 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4666 event pairs, 114 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 3483. Up to 785 conditions per place. [2024-06-28 01:55:03,567 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 73 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-06-28 01:55:03,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 689 flow [2024-06-28 01:55:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-28 01:55:03,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-28 01:55:03,569 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 453 flow. Second operand 6 states and 103 transitions. [2024-06-28 01:55:03,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 689 flow [2024-06-28 01:55:03,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 663 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:55:03,576 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 478 flow [2024-06-28 01:55:03,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-06-28 01:55:03,577 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2024-06-28 01:55:03,577 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 478 flow [2024-06-28 01:55:03,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:03,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:03,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:03,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:55:03,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:03,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2075228773, now seen corresponding path program 1 times [2024-06-28 01:55:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:03,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656686129] [2024-06-28 01:55:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:06,375 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 01:55:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656686129] [2024-06-28 01:55:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656686129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133543200] [2024-06-28 01:55:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:06,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:06,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:06,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:06,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:06,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:06,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:07,430 INFO L124 PetriNetUnfolderBase]: 577/1025 cut-off events. [2024-06-28 01:55:07,430 INFO L125 PetriNetUnfolderBase]: For 3047/3047 co-relation queries the response was YES. [2024-06-28 01:55:07,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1025 events. 577/1025 cut-off events. For 3047/3047 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5045 event pairs, 90 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 3827. Up to 645 conditions per place. [2024-06-28 01:55:07,438 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 96 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-28 01:55:07,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 964 flow [2024-06-28 01:55:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:55:07,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-28 01:55:07,441 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 478 flow. Second operand 10 states and 187 transitions. [2024-06-28 01:55:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 964 flow [2024-06-28 01:55:07,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 929 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:07,449 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 578 flow [2024-06-28 01:55:07,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=578, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-06-28 01:55:07,450 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2024-06-28 01:55:07,450 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 578 flow [2024-06-28 01:55:07,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:07,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:07,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:07,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:55:07,451 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:07,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -918846335, now seen corresponding path program 2 times [2024-06-28 01:55:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918164350] [2024-06-28 01:55:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:10,183 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 01:55:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918164350] [2024-06-28 01:55:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918164350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659426447] [2024-06-28 01:55:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:10,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:10,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:10,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:10,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:10,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:11,218 INFO L124 PetriNetUnfolderBase]: 644/1140 cut-off events. [2024-06-28 01:55:11,218 INFO L125 PetriNetUnfolderBase]: For 4456/4456 co-relation queries the response was YES. [2024-06-28 01:55:11,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 1140 events. 644/1140 cut-off events. For 4456/4456 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5759 event pairs, 89 based on Foata normal form. 2/1141 useless extension candidates. Maximal degree in co-relation 4648. Up to 834 conditions per place. [2024-06-28 01:55:11,227 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 29 changer transitions 0/139 dead transitions. [2024-06-28 01:55:11,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 1119 flow [2024-06-28 01:55:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-28 01:55:11,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-28 01:55:11,229 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 578 flow. Second operand 10 states and 184 transitions. [2024-06-28 01:55:11,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 1119 flow [2024-06-28 01:55:11,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 139 transitions, 1043 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:11,244 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 689 flow [2024-06-28 01:55:11,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-06-28 01:55:11,244 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2024-06-28 01:55:11,245 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 689 flow [2024-06-28 01:55:11,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:11,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:11,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:55:11,245 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:11,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1347955879, now seen corresponding path program 3 times [2024-06-28 01:55:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250698709] [2024-06-28 01:55:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250698709] [2024-06-28 01:55:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250698709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026320686] [2024-06-28 01:55:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:14,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:14,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 689 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:14,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:14,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:14,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:15,201 INFO L124 PetriNetUnfolderBase]: 640/1134 cut-off events. [2024-06-28 01:55:15,202 INFO L125 PetriNetUnfolderBase]: For 4644/4644 co-relation queries the response was YES. [2024-06-28 01:55:15,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 1134 events. 640/1134 cut-off events. For 4644/4644 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5722 event pairs, 89 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 4736. Up to 831 conditions per place. [2024-06-28 01:55:15,218 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 110 selfloop transitions, 29 changer transitions 0/144 dead transitions. [2024-06-28 01:55:15,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 144 transitions, 1127 flow [2024-06-28 01:55:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:55:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:55:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-06-28 01:55:15,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168831168831168 [2024-06-28 01:55:15,220 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 689 flow. Second operand 11 states and 199 transitions. [2024-06-28 01:55:15,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 144 transitions, 1127 flow [2024-06-28 01:55:15,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 1061 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:15,237 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 687 flow [2024-06-28 01:55:15,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=687, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-28 01:55:15,239 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-28 01:55:15,239 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 687 flow [2024-06-28 01:55:15,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:15,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:15,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:15,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:55:15,241 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:15,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash -151271189, now seen corresponding path program 4 times [2024-06-28 01:55:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:15,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991346363] [2024-06-28 01:55:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:17,539 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 01:55:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991346363] [2024-06-28 01:55:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991346363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:17,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537338782] [2024-06-28 01:55:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:17,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:17,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:17,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 687 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:17,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:17,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:18,584 INFO L124 PetriNetUnfolderBase]: 648/1165 cut-off events. [2024-06-28 01:55:18,584 INFO L125 PetriNetUnfolderBase]: For 5128/5131 co-relation queries the response was YES. [2024-06-28 01:55:18,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1165 events. 648/1165 cut-off events. For 5128/5131 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6025 event pairs, 91 based on Foata normal form. 4/1167 useless extension candidates. Maximal degree in co-relation 4903. Up to 628 conditions per place. [2024-06-28 01:55:18,592 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 96 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2024-06-28 01:55:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 1189 flow [2024-06-28 01:55:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:55:18,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 01:55:18,597 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 687 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:55:18,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 1189 flow [2024-06-28 01:55:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 139 transitions, 1127 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-28 01:55:18,610 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 742 flow [2024-06-28 01:55:18,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=742, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-06-28 01:55:18,611 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-28 01:55:18,611 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 742 flow [2024-06-28 01:55:18,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:18,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:18,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:18,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:55:18,612 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:18,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash -158628419, now seen corresponding path program 5 times [2024-06-28 01:55:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933591065] [2024-06-28 01:55:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:21,216 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 01:55:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933591065] [2024-06-28 01:55:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933591065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:21,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313315898] [2024-06-28 01:55:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:21,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:21,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 742 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:21,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:21,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:21,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:22,294 INFO L124 PetriNetUnfolderBase]: 678/1220 cut-off events. [2024-06-28 01:55:22,294 INFO L125 PetriNetUnfolderBase]: For 5762/5762 co-relation queries the response was YES. [2024-06-28 01:55:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 1220 events. 678/1220 cut-off events. For 5762/5762 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6347 event pairs, 94 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 5331. Up to 782 conditions per place. [2024-06-28 01:55:22,303 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 99 selfloop transitions, 39 changer transitions 0/143 dead transitions. [2024-06-28 01:55:22,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 143 transitions, 1231 flow [2024-06-28 01:55:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:55:22,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 01:55:22,305 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 742 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:55:22,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 143 transitions, 1231 flow [2024-06-28 01:55:22,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 143 transitions, 1179 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:22,317 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 816 flow [2024-06-28 01:55:22,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-06-28 01:55:22,318 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-28 01:55:22,318 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 816 flow [2024-06-28 01:55:22,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:22,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:22,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:22,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:55:22,319 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:22,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -158622839, now seen corresponding path program 6 times [2024-06-28 01:55:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913343013] [2024-06-28 01:55:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:24,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913343013] [2024-06-28 01:55:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913343013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988801199] [2024-06-28 01:55:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:24,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:25,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:25,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 816 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:25,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:25,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:25,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:25,997 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-28 01:55:25,998 INFO L125 PetriNetUnfolderBase]: For 5928/5928 co-relation queries the response was YES. [2024-06-28 01:55:26,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5532 conditions, 1214 events. 674/1214 cut-off events. For 5928/5928 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6323 event pairs, 94 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 5486. Up to 779 conditions per place. [2024-06-28 01:55:26,006 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 91 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2024-06-28 01:55:26,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 1206 flow [2024-06-28 01:55:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:55:26,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:55:26,008 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 816 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:55:26,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 1206 flow [2024-06-28 01:55:26,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 1096 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-28 01:55:26,025 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 794 flow [2024-06-28 01:55:26,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-06-28 01:55:26,026 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-28 01:55:26,026 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 794 flow [2024-06-28 01:55:26,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:26,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:26,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:26,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:55:26,027 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:26,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:26,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1281365602, now seen corresponding path program 1 times [2024-06-28 01:55:26,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:26,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749213970] [2024-06-28 01:55:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:26,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:28,859 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 01:55:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749213970] [2024-06-28 01:55:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749213970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567559933] [2024-06-28 01:55:28,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:28,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:28,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:28,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:28,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:28,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:29,897 INFO L124 PetriNetUnfolderBase]: 696/1252 cut-off events. [2024-06-28 01:55:29,897 INFO L125 PetriNetUnfolderBase]: For 5926/5926 co-relation queries the response was YES. [2024-06-28 01:55:29,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 1252 events. 696/1252 cut-off events. For 5926/5926 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6591 event pairs, 64 based on Foata normal form. 2/1253 useless extension candidates. Maximal degree in co-relation 5568. Up to 853 conditions per place. [2024-06-28 01:55:29,907 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 25 changer transitions 0/139 dead transitions. [2024-06-28 01:55:29,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1268 flow [2024-06-28 01:55:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:55:29,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:55:29,910 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 794 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:55:29,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1268 flow [2024-06-28 01:55:29,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1180 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-28 01:55:29,927 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 768 flow [2024-06-28 01:55:29,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-28 01:55:29,928 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-28 01:55:29,928 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 768 flow [2024-06-28 01:55:29,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:29,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:29,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:29,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:55:29,929 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:29,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1278508642, now seen corresponding path program 2 times [2024-06-28 01:55:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126252345] [2024-06-28 01:55:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:32,495 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 01:55:32,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:32,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126252345] [2024-06-28 01:55:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126252345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:32,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309711435] [2024-06-28 01:55:32,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:32,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:32,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:33,539 INFO L124 PetriNetUnfolderBase]: 718/1290 cut-off events. [2024-06-28 01:55:33,539 INFO L125 PetriNetUnfolderBase]: For 5669/5669 co-relation queries the response was YES. [2024-06-28 01:55:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 1290 events. 718/1290 cut-off events. For 5669/5669 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6843 event pairs, 108 based on Foata normal form. 2/1291 useless extension candidates. Maximal degree in co-relation 5598. Up to 996 conditions per place. [2024-06-28 01:55:33,547 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 24 changer transitions 0/138 dead transitions. [2024-06-28 01:55:33,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 138 transitions, 1206 flow [2024-06-28 01:55:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:55:33,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:55:33,554 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 768 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:55:33,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 138 transitions, 1206 flow [2024-06-28 01:55:33,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 138 transitions, 1158 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:33,572 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 782 flow [2024-06-28 01:55:33,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=782, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2024-06-28 01:55:33,572 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2024-06-28 01:55:33,573 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 782 flow [2024-06-28 01:55:33,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:33,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:33,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:33,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:55:33,574 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:33,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1163217472, now seen corresponding path program 3 times [2024-06-28 01:55:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351964870] [2024-06-28 01:55:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:36,242 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 01:55:36,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:36,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351964870] [2024-06-28 01:55:36,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351964870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:36,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:36,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296928088] [2024-06-28 01:55:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:36,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 782 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:37,091 INFO L124 PetriNetUnfolderBase]: 740/1330 cut-off events. [2024-06-28 01:55:37,092 INFO L125 PetriNetUnfolderBase]: For 6030/6030 co-relation queries the response was YES. [2024-06-28 01:55:37,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 1330 events. 740/1330 cut-off events. For 6030/6030 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7109 event pairs, 107 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 5734. Up to 1085 conditions per place. [2024-06-28 01:55:37,100 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 110 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-28 01:55:37,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 1183 flow [2024-06-28 01:55:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:55:37,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:55:37,106 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 782 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:55:37,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 1183 flow [2024-06-28 01:55:37,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1121 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:37,124 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 772 flow [2024-06-28 01:55:37,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-06-28 01:55:37,125 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-06-28 01:55:37,125 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 772 flow [2024-06-28 01:55:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:37,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:37,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:37,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:55:37,126 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:37,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1521376134, now seen corresponding path program 1 times [2024-06-28 01:55:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341229935] [2024-06-28 01:55:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:40,038 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 01:55:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:40,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341229935] [2024-06-28 01:55:40,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341229935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:40,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513602618] [2024-06-28 01:55:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:40,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:40,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:40,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:40,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:40,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:40,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:40,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:40,955 INFO L124 PetriNetUnfolderBase]: 762/1348 cut-off events. [2024-06-28 01:55:40,956 INFO L125 PetriNetUnfolderBase]: For 6373/6373 co-relation queries the response was YES. [2024-06-28 01:55:40,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5787 conditions, 1348 events. 762/1348 cut-off events. For 6373/6373 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7108 event pairs, 93 based on Foata normal form. 2/1349 useless extension candidates. Maximal degree in co-relation 5740. Up to 1087 conditions per place. [2024-06-28 01:55:40,965 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 116 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-28 01:55:40,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1206 flow [2024-06-28 01:55:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 01:55:40,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-28 01:55:40,974 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 772 flow. Second operand 9 states and 163 transitions. [2024-06-28 01:55:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1206 flow [2024-06-28 01:55:40,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1169 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:40,994 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 812 flow [2024-06-28 01:55:40,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-28 01:55:40,994 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:40,995 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 812 flow [2024-06-28 01:55:40,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:40,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:40,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:40,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:55:40,997 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:40,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -622517474, now seen corresponding path program 4 times [2024-06-28 01:55:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792754181] [2024-06-28 01:55:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:43,520 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 01:55:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792754181] [2024-06-28 01:55:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792754181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145641950] [2024-06-28 01:55:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:43,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:43,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:43,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 812 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:43,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:43,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:43,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:44,575 INFO L124 PetriNetUnfolderBase]: 759/1365 cut-off events. [2024-06-28 01:55:44,575 INFO L125 PetriNetUnfolderBase]: For 6687/6687 co-relation queries the response was YES. [2024-06-28 01:55:44,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 1365 events. 759/1365 cut-off events. For 6687/6687 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7343 event pairs, 65 based on Foata normal form. 2/1366 useless extension candidates. Maximal degree in co-relation 5818. Up to 1004 conditions per place. [2024-06-28 01:55:44,584 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 105 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-06-28 01:55:44,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 134 transitions, 1210 flow [2024-06-28 01:55:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-28 01:55:44,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-06-28 01:55:44,586 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 812 flow. Second operand 7 states and 132 transitions. [2024-06-28 01:55:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 134 transitions, 1210 flow [2024-06-28 01:55:44,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1149 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:44,607 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 808 flow [2024-06-28 01:55:44,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-28 01:55:44,607 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:44,608 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 808 flow [2024-06-28 01:55:44,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 01:55:44,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:44,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:44,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:55:44,608 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:44,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -956333804, now seen corresponding path program 2 times [2024-06-28 01:55:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73531850] [2024-06-28 01:55:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:47,565 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 01:55:47,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:47,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73531850] [2024-06-28 01:55:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73531850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277162934] [2024-06-28 01:55:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:47,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:47,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:47,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 808 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:47,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:47,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:47,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:48,316 INFO L124 PetriNetUnfolderBase]: 781/1383 cut-off events. [2024-06-28 01:55:48,316 INFO L125 PetriNetUnfolderBase]: For 7359/7359 co-relation queries the response was YES. [2024-06-28 01:55:48,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 1383 events. 781/1383 cut-off events. For 7359/7359 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7365 event pairs, 94 based on Foata normal form. 2/1384 useless extension candidates. Maximal degree in co-relation 5986. Up to 1092 conditions per place. [2024-06-28 01:55:48,322 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 103 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-28 01:55:48,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1180 flow [2024-06-28 01:55:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:55:48,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 01:55:48,323 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 808 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:55:48,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1180 flow [2024-06-28 01:55:48,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1122 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:48,337 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 836 flow [2024-06-28 01:55:48,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=836, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-28 01:55:48,337 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:48,338 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 836 flow [2024-06-28 01:55:48,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:48,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:48,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:48,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:55:48,338 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:48,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash -394431626, now seen corresponding path program 3 times [2024-06-28 01:55:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812731976] [2024-06-28 01:55:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:51,287 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 01:55:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812731976] [2024-06-28 01:55:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812731976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:51,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179488480] [2024-06-28 01:55:51,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:51,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:51,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 836 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:51,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:51,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:51,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:52,151 INFO L124 PetriNetUnfolderBase]: 803/1442 cut-off events. [2024-06-28 01:55:52,151 INFO L125 PetriNetUnfolderBase]: For 7647/7650 co-relation queries the response was YES. [2024-06-28 01:55:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 1442 events. 803/1442 cut-off events. For 7647/7650 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7840 event pairs, 98 based on Foata normal form. 4/1444 useless extension candidates. Maximal degree in co-relation 6185. Up to 1080 conditions per place. [2024-06-28 01:55:52,159 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 105 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-28 01:55:52,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1228 flow [2024-06-28 01:55:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-28 01:55:52,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:55:52,160 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 836 flow. Second operand 7 states and 126 transitions. [2024-06-28 01:55:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1228 flow [2024-06-28 01:55:52,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 1154 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:52,180 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 826 flow [2024-06-28 01:55:52,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=826, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2024-06-28 01:55:52,180 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2024-06-28 01:55:52,181 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 826 flow [2024-06-28 01:55:52,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:52,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:52,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:52,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:55:52,181 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:52,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -385860746, now seen corresponding path program 4 times [2024-06-28 01:55:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579486240] [2024-06-28 01:55:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:54,823 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 01:55:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579486240] [2024-06-28 01:55:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579486240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835316396] [2024-06-28 01:55:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:54,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:54,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:54,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 826 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:54,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:55,690 INFO L124 PetriNetUnfolderBase]: 804/1449 cut-off events. [2024-06-28 01:55:55,690 INFO L125 PetriNetUnfolderBase]: For 6929/6932 co-relation queries the response was YES. [2024-06-28 01:55:55,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 1449 events. 804/1449 cut-off events. For 6929/6932 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7913 event pairs, 99 based on Foata normal form. 4/1451 useless extension candidates. Maximal degree in co-relation 6109. Up to 949 conditions per place. [2024-06-28 01:55:55,698 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 103 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-06-28 01:55:55,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 133 transitions, 1236 flow [2024-06-28 01:55:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-28 01:55:55,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-28 01:55:55,700 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 826 flow. Second operand 7 states and 124 transitions. [2024-06-28 01:55:55,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 133 transitions, 1236 flow [2024-06-28 01:55:55,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1192 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:55,714 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 847 flow [2024-06-28 01:55:55,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-28 01:55:55,715 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2024-06-28 01:55:55,715 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 847 flow [2024-06-28 01:55:55,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:55,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:55,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:55,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:55:55,716 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:55,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash 942672028, now seen corresponding path program 1 times [2024-06-28 01:55:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:55,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068542692] [2024-06-28 01:55:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068542692] [2024-06-28 01:55:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068542692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:55:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635330798] [2024-06-28 01:55:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:55:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:55,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:55:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:55:55,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:55:55,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:55,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:55,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:55:55,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:55,994 INFO L124 PetriNetUnfolderBase]: 435/865 cut-off events. [2024-06-28 01:55:55,994 INFO L125 PetriNetUnfolderBase]: For 4827/4863 co-relation queries the response was YES. [2024-06-28 01:55:55,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3400 conditions, 865 events. 435/865 cut-off events. For 4827/4863 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4642 event pairs, 87 based on Foata normal form. 66/897 useless extension candidates. Maximal degree in co-relation 3350. Up to 327 conditions per place. [2024-06-28 01:55:55,998 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 52 selfloop transitions, 22 changer transitions 1/96 dead transitions. [2024-06-28 01:55:55,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 904 flow [2024-06-28 01:55:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:55:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:55:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-28 01:55:55,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-28 01:55:55,999 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 847 flow. Second operand 4 states and 86 transitions. [2024-06-28 01:55:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 904 flow [2024-06-28 01:55:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 766 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-06-28 01:55:56,009 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 629 flow [2024-06-28 01:55:56,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=629, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-28 01:55:56,009 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-06-28 01:55:56,009 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 629 flow [2024-06-28 01:55:56,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:56,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:56,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:56,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:55:56,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:56,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash 446239458, now seen corresponding path program 1 times [2024-06-28 01:55:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122574160] [2024-06-28 01:55:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122574160] [2024-06-28 01:55:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122574160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:58,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:58,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499528889] [2024-06-28 01:55:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:58,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:58,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 629 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:58,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:58,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:58,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:59,304 INFO L124 PetriNetUnfolderBase]: 843/1588 cut-off events. [2024-06-28 01:55:59,305 INFO L125 PetriNetUnfolderBase]: For 9010/9012 co-relation queries the response was YES. [2024-06-28 01:55:59,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 1588 events. 843/1588 cut-off events. For 9010/9012 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8763 event pairs, 260 based on Foata normal form. 10/1597 useless extension candidates. Maximal degree in co-relation 6114. Up to 755 conditions per place. [2024-06-28 01:55:59,312 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 109 selfloop transitions, 76 changer transitions 0/190 dead transitions. [2024-06-28 01:55:59,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 190 transitions, 1783 flow [2024-06-28 01:55:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:55:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:55:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2024-06-28 01:55:59,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2024-06-28 01:55:59,314 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 629 flow. Second operand 13 states and 215 transitions. [2024-06-28 01:55:59,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 190 transitions, 1783 flow [2024-06-28 01:55:59,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 190 transitions, 1572 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:59,340 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 1230 flow [2024-06-28 01:55:59,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1230, PETRI_PLACES=111, PETRI_TRANSITIONS=128} [2024-06-28 01:55:59,340 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-28 01:55:59,340 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 1230 flow [2024-06-28 01:55:59,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:55:59,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:59,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:59,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:55:59,341 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:55:59,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1067626850, now seen corresponding path program 2 times [2024-06-28 01:55:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821697986] [2024-06-28 01:55:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:02,355 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 01:56:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821697986] [2024-06-28 01:56:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821697986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049341871] [2024-06-28 01:56:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:02,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:02,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:02,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 1230 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:02,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:02,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:02,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:03,517 INFO L124 PetriNetUnfolderBase]: 1207/2236 cut-off events. [2024-06-28 01:56:03,517 INFO L125 PetriNetUnfolderBase]: For 13030/13035 co-relation queries the response was YES. [2024-06-28 01:56:03,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8803 conditions, 2236 events. 1207/2236 cut-off events. For 13030/13035 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13380 event pairs, 431 based on Foata normal form. 10/2243 useless extension candidates. Maximal degree in co-relation 8754. Up to 1173 conditions per place. [2024-06-28 01:56:03,528 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 112 selfloop transitions, 95 changer transitions 0/212 dead transitions. [2024-06-28 01:56:03,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 212 transitions, 2258 flow [2024-06-28 01:56:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:56:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:56:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2024-06-28 01:56:03,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595238095238095 [2024-06-28 01:56:03,529 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 1230 flow. Second operand 12 states and 193 transitions. [2024-06-28 01:56:03,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 212 transitions, 2258 flow [2024-06-28 01:56:03,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 212 transitions, 2187 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:03,552 INFO L231 Difference]: Finished difference. Result has 127 places, 162 transitions, 1929 flow [2024-06-28 01:56:03,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1929, PETRI_PLACES=127, PETRI_TRANSITIONS=162} [2024-06-28 01:56:03,553 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2024-06-28 01:56:03,553 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 162 transitions, 1929 flow [2024-06-28 01:56:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:03,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:03,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:03,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:56:03,554 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:03,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1059976832, now seen corresponding path program 3 times [2024-06-28 01:56:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:03,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041489209] [2024-06-28 01:56:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:05,496 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 01:56:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041489209] [2024-06-28 01:56:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041489209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771650774] [2024-06-28 01:56:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:05,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:05,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 162 transitions, 1929 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:06,635 INFO L124 PetriNetUnfolderBase]: 1721/3197 cut-off events. [2024-06-28 01:56:06,635 INFO L125 PetriNetUnfolderBase]: For 21329/21331 co-relation queries the response was YES. [2024-06-28 01:56:06,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12793 conditions, 3197 events. 1721/3197 cut-off events. For 21329/21331 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20884 event pairs, 739 based on Foata normal form. 10/3206 useless extension candidates. Maximal degree in co-relation 12736. Up to 1838 conditions per place. [2024-06-28 01:56:06,654 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 120 selfloop transitions, 126 changer transitions 0/251 dead transitions. [2024-06-28 01:56:06,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 251 transitions, 3044 flow [2024-06-28 01:56:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 213 transitions. [2024-06-28 01:56:06,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46813186813186813 [2024-06-28 01:56:06,657 INFO L175 Difference]: Start difference. First operand has 127 places, 162 transitions, 1929 flow. Second operand 13 states and 213 transitions. [2024-06-28 01:56:06,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 251 transitions, 3044 flow [2024-06-28 01:56:06,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 251 transitions, 2994 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-28 01:56:06,699 INFO L231 Difference]: Finished difference. Result has 143 places, 190 transitions, 2639 flow [2024-06-28 01:56:06,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2639, PETRI_PLACES=143, PETRI_TRANSITIONS=190} [2024-06-28 01:56:06,700 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 106 predicate places. [2024-06-28 01:56:06,700 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 190 transitions, 2639 flow [2024-06-28 01:56:06,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:06,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:06,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:06,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:56:06,700 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:06,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1868996510, now seen corresponding path program 4 times [2024-06-28 01:56:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227559617] [2024-06-28 01:56:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:08,564 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 01:56:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227559617] [2024-06-28 01:56:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227559617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897451085] [2024-06-28 01:56:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:08,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:08,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 190 transitions, 2639 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:08,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:08,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:10,158 INFO L124 PetriNetUnfolderBase]: 2007/3729 cut-off events. [2024-06-28 01:56:10,159 INFO L125 PetriNetUnfolderBase]: For 27801/27803 co-relation queries the response was YES. [2024-06-28 01:56:10,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15549 conditions, 3729 events. 2007/3729 cut-off events. For 27801/27803 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25267 event pairs, 985 based on Foata normal form. 10/3738 useless extension candidates. Maximal degree in co-relation 15485. Up to 2594 conditions per place. [2024-06-28 01:56:10,182 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 124 selfloop transitions, 127 changer transitions 0/256 dead transitions. [2024-06-28 01:56:10,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 256 transitions, 3619 flow [2024-06-28 01:56:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 217 transitions. [2024-06-28 01:56:10,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-28 01:56:10,183 INFO L175 Difference]: Start difference. First operand has 143 places, 190 transitions, 2639 flow. Second operand 14 states and 217 transitions. [2024-06-28 01:56:10,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 256 transitions, 3619 flow [2024-06-28 01:56:10,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 256 transitions, 3501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:10,244 INFO L231 Difference]: Finished difference. Result has 154 places, 203 transitions, 3011 flow [2024-06-28 01:56:10,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3011, PETRI_PLACES=154, PETRI_TRANSITIONS=203} [2024-06-28 01:56:10,245 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 117 predicate places. [2024-06-28 01:56:10,245 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 203 transitions, 3011 flow [2024-06-28 01:56:10,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:10,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:10,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:56:10,246 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:10,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1672714654, now seen corresponding path program 5 times [2024-06-28 01:56:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450314477] [2024-06-28 01:56:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:12,094 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 01:56:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:12,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450314477] [2024-06-28 01:56:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450314477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:12,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200495247] [2024-06-28 01:56:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:12,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:12,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:12,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:12,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 203 transitions, 3011 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:12,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:12,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:12,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:13,625 INFO L124 PetriNetUnfolderBase]: 2010/3762 cut-off events. [2024-06-28 01:56:13,626 INFO L125 PetriNetUnfolderBase]: For 28459/28461 co-relation queries the response was YES. [2024-06-28 01:56:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15693 conditions, 3762 events. 2010/3762 cut-off events. For 28459/28461 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25611 event pairs, 1141 based on Foata normal form. 12/3773 useless extension candidates. Maximal degree in co-relation 15626. Up to 2913 conditions per place. [2024-06-28 01:56:13,653 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 118 selfloop transitions, 123 changer transitions 0/246 dead transitions. [2024-06-28 01:56:13,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 246 transitions, 3708 flow [2024-06-28 01:56:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2024-06-28 01:56:13,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432967032967033 [2024-06-28 01:56:13,655 INFO L175 Difference]: Start difference. First operand has 154 places, 203 transitions, 3011 flow. Second operand 13 states and 197 transitions. [2024-06-28 01:56:13,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 246 transitions, 3708 flow [2024-06-28 01:56:13,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 246 transitions, 3417 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:13,726 INFO L231 Difference]: Finished difference. Result has 158 places, 203 transitions, 2995 flow [2024-06-28 01:56:13,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2741, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2995, PETRI_PLACES=158, PETRI_TRANSITIONS=203} [2024-06-28 01:56:13,726 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 121 predicate places. [2024-06-28 01:56:13,727 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 203 transitions, 2995 flow [2024-06-28 01:56:13,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:13,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:13,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:13,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:56:13,728 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:13,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:13,728 INFO L85 PathProgramCache]: Analyzing trace with hash -19076318, now seen corresponding path program 6 times [2024-06-28 01:56:13,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:13,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059119006] [2024-06-28 01:56:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:15,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059119006] [2024-06-28 01:56:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059119006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:15,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971775869] [2024-06-28 01:56:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:15,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:15,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:15,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:15,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 203 transitions, 2995 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:15,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:15,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:15,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:16,712 INFO L124 PetriNetUnfolderBase]: 2738/5120 cut-off events. [2024-06-28 01:56:16,712 INFO L125 PetriNetUnfolderBase]: For 32062/32064 co-relation queries the response was YES. [2024-06-28 01:56:16,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19915 conditions, 5120 events. 2738/5120 cut-off events. For 32062/32064 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 37064 event pairs, 1134 based on Foata normal form. 10/5129 useless extension candidates. Maximal degree in co-relation 19847. Up to 2822 conditions per place. [2024-06-28 01:56:16,748 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 150 selfloop transitions, 140 changer transitions 0/295 dead transitions. [2024-06-28 01:56:16,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 295 transitions, 4236 flow [2024-06-28 01:56:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:56:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:56:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 205 transitions. [2024-06-28 01:56:16,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-28 01:56:16,749 INFO L175 Difference]: Start difference. First operand has 158 places, 203 transitions, 2995 flow. Second operand 12 states and 205 transitions. [2024-06-28 01:56:16,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 295 transitions, 4236 flow [2024-06-28 01:56:16,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 295 transitions, 3996 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:16,832 INFO L231 Difference]: Finished difference. Result has 162 places, 225 transitions, 3464 flow [2024-06-28 01:56:16,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3464, PETRI_PLACES=162, PETRI_TRANSITIONS=225} [2024-06-28 01:56:16,833 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 125 predicate places. [2024-06-28 01:56:16,833 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 225 transitions, 3464 flow [2024-06-28 01:56:16,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:16,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:16,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:16,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:56:16,833 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:16,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -544664418, now seen corresponding path program 7 times [2024-06-28 01:56:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273356154] [2024-06-28 01:56:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:18,993 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 01:56:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273356154] [2024-06-28 01:56:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273356154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027150276] [2024-06-28 01:56:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:18,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:19,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:19,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 225 transitions, 3464 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:19,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:19,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:19,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:21,162 INFO L124 PetriNetUnfolderBase]: 3189/5971 cut-off events. [2024-06-28 01:56:21,162 INFO L125 PetriNetUnfolderBase]: For 45981/45983 co-relation queries the response was YES. [2024-06-28 01:56:21,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23743 conditions, 5971 events. 3189/5971 cut-off events. For 45981/45983 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 45083 event pairs, 1940 based on Foata normal form. 10/5980 useless extension candidates. Maximal degree in co-relation 23671. Up to 4356 conditions per place. [2024-06-28 01:56:21,200 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 156 selfloop transitions, 126 changer transitions 0/287 dead transitions. [2024-06-28 01:56:21,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 287 transitions, 4448 flow [2024-06-28 01:56:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2024-06-28 01:56:21,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45102040816326533 [2024-06-28 01:56:21,202 INFO L175 Difference]: Start difference. First operand has 162 places, 225 transitions, 3464 flow. Second operand 14 states and 221 transitions. [2024-06-28 01:56:21,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 287 transitions, 4448 flow [2024-06-28 01:56:21,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 287 transitions, 4218 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:21,316 INFO L231 Difference]: Finished difference. Result has 170 places, 233 transitions, 3669 flow [2024-06-28 01:56:21,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3669, PETRI_PLACES=170, PETRI_TRANSITIONS=233} [2024-06-28 01:56:21,317 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 133 predicate places. [2024-06-28 01:56:21,317 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 233 transitions, 3669 flow [2024-06-28 01:56:21,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:21,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:21,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:21,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:56:21,318 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:21,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2029605874, now seen corresponding path program 8 times [2024-06-28 01:56:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:21,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839109467] [2024-06-28 01:56:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:23,374 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 01:56:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839109467] [2024-06-28 01:56:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839109467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401359178] [2024-06-28 01:56:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:23,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:23,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 233 transitions, 3669 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:23,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:23,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:23,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:25,367 INFO L124 PetriNetUnfolderBase]: 3176/5948 cut-off events. [2024-06-28 01:56:25,367 INFO L125 PetriNetUnfolderBase]: For 43369/43373 co-relation queries the response was YES. [2024-06-28 01:56:25,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23452 conditions, 5948 events. 3176/5948 cut-off events. For 43369/43373 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 44726 event pairs, 2139 based on Foata normal form. 14/5961 useless extension candidates. Maximal degree in co-relation 23378. Up to 4914 conditions per place. [2024-06-28 01:56:25,407 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 148 selfloop transitions, 124 changer transitions 0/277 dead transitions. [2024-06-28 01:56:25,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 277 transitions, 4451 flow [2024-06-28 01:56:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2024-06-28 01:56:25,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2024-06-28 01:56:25,409 INFO L175 Difference]: Start difference. First operand has 170 places, 233 transitions, 3669 flow. Second operand 13 states and 200 transitions. [2024-06-28 01:56:25,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 277 transitions, 4451 flow [2024-06-28 01:56:25,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 277 transitions, 4183 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:25,509 INFO L231 Difference]: Finished difference. Result has 174 places, 238 transitions, 3764 flow [2024-06-28 01:56:25,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3764, PETRI_PLACES=174, PETRI_TRANSITIONS=238} [2024-06-28 01:56:25,510 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 137 predicate places. [2024-06-28 01:56:25,510 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 3764 flow [2024-06-28 01:56:25,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:25,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:25,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:25,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:56:25,510 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:25,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1152905766, now seen corresponding path program 9 times [2024-06-28 01:56:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961089020] [2024-06-28 01:56:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961089020] [2024-06-28 01:56:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961089020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114297186] [2024-06-28 01:56:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:27,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:27,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:27,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 3764 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:27,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:27,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:27,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:29,408 INFO L124 PetriNetUnfolderBase]: 3434/6431 cut-off events. [2024-06-28 01:56:29,408 INFO L125 PetriNetUnfolderBase]: For 46058/46062 co-relation queries the response was YES. [2024-06-28 01:56:29,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25091 conditions, 6431 events. 3434/6431 cut-off events. For 46058/46062 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 49214 event pairs, 2378 based on Foata normal form. 14/6444 useless extension candidates. Maximal degree in co-relation 25016. Up to 5540 conditions per place. [2024-06-28 01:56:29,450 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 232 selfloop transitions, 56 changer transitions 0/293 dead transitions. [2024-06-28 01:56:29,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 293 transitions, 4785 flow [2024-06-28 01:56:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 205 transitions. [2024-06-28 01:56:29,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-28 01:56:29,452 INFO L175 Difference]: Start difference. First operand has 174 places, 238 transitions, 3764 flow. Second operand 14 states and 205 transitions. [2024-06-28 01:56:29,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 293 transitions, 4785 flow [2024-06-28 01:56:29,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 293 transitions, 4530 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:29,565 INFO L231 Difference]: Finished difference. Result has 181 places, 249 transitions, 3892 flow [2024-06-28 01:56:29,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3529, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3892, PETRI_PLACES=181, PETRI_TRANSITIONS=249} [2024-06-28 01:56:29,566 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 144 predicate places. [2024-06-28 01:56:29,566 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 249 transitions, 3892 flow [2024-06-28 01:56:29,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:29,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:29,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:29,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:56:29,566 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:29,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1544420396, now seen corresponding path program 10 times [2024-06-28 01:56:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:29,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526402640] [2024-06-28 01:56:29,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:29,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:31,807 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 01:56:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526402640] [2024-06-28 01:56:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526402640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343841428] [2024-06-28 01:56:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:31,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:31,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 249 transitions, 3892 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:31,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:31,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:33,717 INFO L124 PetriNetUnfolderBase]: 3639/6826 cut-off events. [2024-06-28 01:56:33,717 INFO L125 PetriNetUnfolderBase]: For 46829/46835 co-relation queries the response was YES. [2024-06-28 01:56:33,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26150 conditions, 6826 events. 3639/6826 cut-off events. For 46829/46835 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 52922 event pairs, 2563 based on Foata normal form. 16/6841 useless extension candidates. Maximal degree in co-relation 26070. Up to 5915 conditions per place. [2024-06-28 01:56:33,767 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 231 selfloop transitions, 56 changer transitions 0/292 dead transitions. [2024-06-28 01:56:33,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 292 transitions, 4694 flow [2024-06-28 01:56:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2024-06-28 01:56:33,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42637362637362636 [2024-06-28 01:56:33,769 INFO L175 Difference]: Start difference. First operand has 181 places, 249 transitions, 3892 flow. Second operand 13 states and 194 transitions. [2024-06-28 01:56:33,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 292 transitions, 4694 flow [2024-06-28 01:56:33,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 292 transitions, 4581 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:33,912 INFO L231 Difference]: Finished difference. Result has 189 places, 249 transitions, 3899 flow [2024-06-28 01:56:33,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3779, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3899, PETRI_PLACES=189, PETRI_TRANSITIONS=249} [2024-06-28 01:56:33,913 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2024-06-28 01:56:33,913 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 249 transitions, 3899 flow [2024-06-28 01:56:33,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:33,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:33,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:33,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:56:33,913 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:33,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1544272526, now seen corresponding path program 11 times [2024-06-28 01:56:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025883526] [2024-06-28 01:56:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:36,049 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 01:56:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025883526] [2024-06-28 01:56:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025883526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773053158] [2024-06-28 01:56:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:36,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:36,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 249 transitions, 3899 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:36,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:36,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:38,106 INFO L124 PetriNetUnfolderBase]: 3693/6944 cut-off events. [2024-06-28 01:56:38,106 INFO L125 PetriNetUnfolderBase]: For 44538/44544 co-relation queries the response was YES. [2024-06-28 01:56:38,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26249 conditions, 6944 events. 3693/6944 cut-off events. For 44538/44544 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 54159 event pairs, 2382 based on Foata normal form. 14/6957 useless extension candidates. Maximal degree in co-relation 26170. Up to 5265 conditions per place. [2024-06-28 01:56:38,148 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 240 selfloop transitions, 58 changer transitions 0/303 dead transitions. [2024-06-28 01:56:38,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 303 transitions, 4820 flow [2024-06-28 01:56:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2024-06-28 01:56:38,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2024-06-28 01:56:38,150 INFO L175 Difference]: Start difference. First operand has 189 places, 249 transitions, 3899 flow. Second operand 13 states and 200 transitions. [2024-06-28 01:56:38,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 303 transitions, 4820 flow [2024-06-28 01:56:38,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 303 transitions, 4690 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:38,273 INFO L231 Difference]: Finished difference. Result has 192 places, 254 transitions, 4005 flow [2024-06-28 01:56:38,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3785, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4005, PETRI_PLACES=192, PETRI_TRANSITIONS=254} [2024-06-28 01:56:38,274 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 155 predicate places. [2024-06-28 01:56:38,274 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 254 transitions, 4005 flow [2024-06-28 01:56:38,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:38,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:38,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:56:38,274 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:38,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1195435814, now seen corresponding path program 1 times [2024-06-28 01:56:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541976517] [2024-06-28 01:56:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:41,244 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 01:56:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541976517] [2024-06-28 01:56:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541976517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:41,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101896296] [2024-06-28 01:56:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:41,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:41,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:41,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:41,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:41,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:41,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 254 transitions, 4005 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:41,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:41,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:41,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:43,315 INFO L124 PetriNetUnfolderBase]: 3767/7112 cut-off events. [2024-06-28 01:56:43,315 INFO L125 PetriNetUnfolderBase]: For 45919/45925 co-relation queries the response was YES. [2024-06-28 01:56:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27010 conditions, 7112 events. 3767/7112 cut-off events. For 45919/45925 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 55843 event pairs, 2594 based on Foata normal form. 12/7123 useless extension candidates. Maximal degree in co-relation 26929. Up to 5562 conditions per place. [2024-06-28 01:56:43,365 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 254 selfloop transitions, 57 changer transitions 0/316 dead transitions. [2024-06-28 01:56:43,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 316 transitions, 5056 flow [2024-06-28 01:56:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 210 transitions. [2024-06-28 01:56:43,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 01:56:43,367 INFO L175 Difference]: Start difference. First operand has 192 places, 254 transitions, 4005 flow. Second operand 14 states and 210 transitions. [2024-06-28 01:56:43,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 316 transitions, 5056 flow [2024-06-28 01:56:43,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 316 transitions, 4905 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-28 01:56:43,500 INFO L231 Difference]: Finished difference. Result has 199 places, 264 transitions, 4174 flow [2024-06-28 01:56:43,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3890, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4174, PETRI_PLACES=199, PETRI_TRANSITIONS=264} [2024-06-28 01:56:43,500 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 162 predicate places. [2024-06-28 01:56:43,500 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 264 transitions, 4174 flow [2024-06-28 01:56:43,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:43,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:43,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:56:43,501 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:43,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1212752736, now seen corresponding path program 12 times [2024-06-28 01:56:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267728851] [2024-06-28 01:56:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:46,698 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 01:56:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:46,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267728851] [2024-06-28 01:56:46,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267728851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:46,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893826088] [2024-06-28 01:56:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:46,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:46,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:46,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:46,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 264 transitions, 4174 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:46,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:46,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:48,589 INFO L124 PetriNetUnfolderBase]: 3949/7433 cut-off events. [2024-06-28 01:56:48,589 INFO L125 PetriNetUnfolderBase]: For 48826/48832 co-relation queries the response was YES. [2024-06-28 01:56:48,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28462 conditions, 7433 events. 3949/7433 cut-off events. For 48826/48832 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 58666 event pairs, 2697 based on Foata normal form. 16/7448 useless extension candidates. Maximal degree in co-relation 28377. Up to 5701 conditions per place. [2024-06-28 01:56:48,648 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 156 selfloop transitions, 148 changer transitions 0/309 dead transitions. [2024-06-28 01:56:48,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 309 transitions, 5069 flow [2024-06-28 01:56:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-28 01:56:48,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-28 01:56:48,650 INFO L175 Difference]: Start difference. First operand has 199 places, 264 transitions, 4174 flow. Second operand 11 states and 170 transitions. [2024-06-28 01:56:48,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 309 transitions, 5069 flow [2024-06-28 01:56:48,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 309 transitions, 4984 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:48,803 INFO L231 Difference]: Finished difference. Result has 201 places, 270 transitions, 4520 flow [2024-06-28 01:56:48,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4089, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4520, PETRI_PLACES=201, PETRI_TRANSITIONS=270} [2024-06-28 01:56:48,804 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 164 predicate places. [2024-06-28 01:56:48,804 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 270 transitions, 4520 flow [2024-06-28 01:56:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:48,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:48,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:48,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:56:48,805 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:48,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1212604866, now seen corresponding path program 13 times [2024-06-28 01:56:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111349952] [2024-06-28 01:56:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:51,746 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 01:56:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111349952] [2024-06-28 01:56:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111349952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857330613] [2024-06-28 01:56:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:51,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:51,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:51,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 270 transitions, 4520 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:51,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:51,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:53,748 INFO L124 PetriNetUnfolderBase]: 4089/7685 cut-off events. [2024-06-28 01:56:53,748 INFO L125 PetriNetUnfolderBase]: For 52413/52419 co-relation queries the response was YES. [2024-06-28 01:56:53,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29841 conditions, 7685 events. 4089/7685 cut-off events. For 52413/52419 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 61162 event pairs, 2306 based on Foata normal form. 14/7698 useless extension candidates. Maximal degree in co-relation 29755. Up to 4899 conditions per place. [2024-06-28 01:56:53,802 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 154 selfloop transitions, 172 changer transitions 0/331 dead transitions. [2024-06-28 01:56:53,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 331 transitions, 5625 flow [2024-06-28 01:56:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:56:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:56:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 189 transitions. [2024-06-28 01:56:53,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-28 01:56:53,804 INFO L175 Difference]: Start difference. First operand has 201 places, 270 transitions, 4520 flow. Second operand 12 states and 189 transitions. [2024-06-28 01:56:53,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 331 transitions, 5625 flow [2024-06-28 01:56:53,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 331 transitions, 5346 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:53,965 INFO L231 Difference]: Finished difference. Result has 205 places, 283 transitions, 4899 flow [2024-06-28 01:56:53,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4899, PETRI_PLACES=205, PETRI_TRANSITIONS=283} [2024-06-28 01:56:53,965 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 168 predicate places. [2024-06-28 01:56:53,966 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 283 transitions, 4899 flow [2024-06-28 01:56:53,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:53,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:53,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:56:53,966 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:53,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash 491811710, now seen corresponding path program 14 times [2024-06-28 01:56:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:53,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806738019] [2024-06-28 01:56:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:56,790 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 01:56:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806738019] [2024-06-28 01:56:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806738019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836815558] [2024-06-28 01:56:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:56,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:56,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:56,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 283 transitions, 4899 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:56,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:56,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:56,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:58,996 INFO L124 PetriNetUnfolderBase]: 4323/8100 cut-off events. [2024-06-28 01:56:58,996 INFO L125 PetriNetUnfolderBase]: For 59904/59910 co-relation queries the response was YES. [2024-06-28 01:56:59,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31976 conditions, 8100 events. 4323/8100 cut-off events. For 59904/59910 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 64929 event pairs, 3039 based on Foata normal form. 16/8115 useless extension candidates. Maximal degree in co-relation 31888. Up to 6794 conditions per place. [2024-06-28 01:56:59,056 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 241 selfloop transitions, 86 changer transitions 0/332 dead transitions. [2024-06-28 01:56:59,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 332 transitions, 5898 flow [2024-06-28 01:56:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-28 01:56:59,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2024-06-28 01:56:59,058 INFO L175 Difference]: Start difference. First operand has 205 places, 283 transitions, 4899 flow. Second operand 11 states and 167 transitions. [2024-06-28 01:56:59,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 332 transitions, 5898 flow [2024-06-28 01:56:59,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 332 transitions, 5646 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:59,252 INFO L231 Difference]: Finished difference. Result has 208 places, 291 transitions, 4990 flow [2024-06-28 01:56:59,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4647, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4990, PETRI_PLACES=208, PETRI_TRANSITIONS=291} [2024-06-28 01:56:59,253 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 171 predicate places. [2024-06-28 01:56:59,253 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 291 transitions, 4990 flow [2024-06-28 01:56:59,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:56:59,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:59,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:59,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:56:59,254 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:56:59,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash 81765862, now seen corresponding path program 15 times [2024-06-28 01:56:59,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:59,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659607592] [2024-06-28 01:56:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:02,319 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 01:57:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659607592] [2024-06-28 01:57:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659607592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366661135] [2024-06-28 01:57:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:02,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:02,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:02,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:02,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 291 transitions, 4990 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:02,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:02,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:02,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:04,624 INFO L124 PetriNetUnfolderBase]: 4557/8513 cut-off events. [2024-06-28 01:57:04,624 INFO L125 PetriNetUnfolderBase]: For 61844/61853 co-relation queries the response was YES. [2024-06-28 01:57:04,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33558 conditions, 8513 events. 4557/8513 cut-off events. For 61844/61853 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 68823 event pairs, 3274 based on Foata normal form. 16/8527 useless extension candidates. Maximal degree in co-relation 33468. Up to 7553 conditions per place. [2024-06-28 01:57:04,688 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 257 selfloop transitions, 70 changer transitions 0/332 dead transitions. [2024-06-28 01:57:04,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 332 transitions, 5910 flow [2024-06-28 01:57:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:57:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:57:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 187 transitions. [2024-06-28 01:57:04,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41098901098901097 [2024-06-28 01:57:04,690 INFO L175 Difference]: Start difference. First operand has 208 places, 291 transitions, 4990 flow. Second operand 13 states and 187 transitions. [2024-06-28 01:57:04,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 332 transitions, 5910 flow [2024-06-28 01:57:04,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 332 transitions, 5724 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:04,913 INFO L231 Difference]: Finished difference. Result has 213 places, 297 transitions, 5093 flow [2024-06-28 01:57:04,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4806, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5093, PETRI_PLACES=213, PETRI_TRANSITIONS=297} [2024-06-28 01:57:04,914 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 176 predicate places. [2024-06-28 01:57:04,914 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 297 transitions, 5093 flow [2024-06-28 01:57:04,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:04,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:04,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:04,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:57:04,915 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:04,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1700002116, now seen corresponding path program 16 times [2024-06-28 01:57:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:04,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597996248] [2024-06-28 01:57:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:08,195 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 01:57:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597996248] [2024-06-28 01:57:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597996248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:08,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986633480] [2024-06-28 01:57:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:08,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:08,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:08,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 297 transitions, 5093 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:08,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:08,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:08,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:10,480 INFO L124 PetriNetUnfolderBase]: 4737/8838 cut-off events. [2024-06-28 01:57:10,480 INFO L125 PetriNetUnfolderBase]: For 63494/63498 co-relation queries the response was YES. [2024-06-28 01:57:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34704 conditions, 8838 events. 4737/8838 cut-off events. For 63494/63498 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 71966 event pairs, 2954 based on Foata normal form. 12/8849 useless extension candidates. Maximal degree in co-relation 34612. Up to 5996 conditions per place. [2024-06-28 01:57:10,572 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 247 selfloop transitions, 103 changer transitions 0/355 dead transitions. [2024-06-28 01:57:10,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 355 transitions, 6279 flow [2024-06-28 01:57:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-28 01:57:10,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44935064935064933 [2024-06-28 01:57:10,574 INFO L175 Difference]: Start difference. First operand has 213 places, 297 transitions, 5093 flow. Second operand 11 states and 173 transitions. [2024-06-28 01:57:10,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 355 transitions, 6279 flow [2024-06-28 01:57:10,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 355 transitions, 6043 flow, removed 23 selfloop flow, removed 12 redundant places. [2024-06-28 01:57:10,790 INFO L231 Difference]: Finished difference. Result has 213 places, 309 transitions, 5407 flow [2024-06-28 01:57:10,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4857, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5407, PETRI_PLACES=213, PETRI_TRANSITIONS=309} [2024-06-28 01:57:10,790 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 176 predicate places. [2024-06-28 01:57:10,791 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 309 transitions, 5407 flow [2024-06-28 01:57:10,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:10,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:10,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:57:10,791 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:10,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1694276664, now seen corresponding path program 2 times [2024-06-28 01:57:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308199173] [2024-06-28 01:57:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:15,242 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 01:57:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308199173] [2024-06-28 01:57:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308199173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019366090] [2024-06-28 01:57:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:15,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:15,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:15,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 309 transitions, 5407 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:15,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:15,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:15,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,498 INFO L124 PetriNetUnfolderBase]: 4779/8924 cut-off events. [2024-06-28 01:57:17,498 INFO L125 PetriNetUnfolderBase]: For 65773/65777 co-relation queries the response was YES. [2024-06-28 01:57:17,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35444 conditions, 8924 events. 4779/8924 cut-off events. For 65773/65777 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 72773 event pairs, 3263 based on Foata normal form. 10/8933 useless extension candidates. Maximal degree in co-relation 35350. Up to 6623 conditions per place. [2024-06-28 01:57:17,575 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 256 selfloop transitions, 99 changer transitions 0/360 dead transitions. [2024-06-28 01:57:17,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 360 transitions, 6436 flow [2024-06-28 01:57:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:57:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:57:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2024-06-28 01:57:17,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-28 01:57:17,577 INFO L175 Difference]: Start difference. First operand has 213 places, 309 transitions, 5407 flow. Second operand 12 states and 183 transitions. [2024-06-28 01:57:17,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 360 transitions, 6436 flow [2024-06-28 01:57:17,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 360 transitions, 6234 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:17,838 INFO L231 Difference]: Finished difference. Result has 219 places, 313 transitions, 5545 flow [2024-06-28 01:57:17,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5205, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5545, PETRI_PLACES=219, PETRI_TRANSITIONS=313} [2024-06-28 01:57:17,838 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 182 predicate places. [2024-06-28 01:57:17,839 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 313 transitions, 5545 flow [2024-06-28 01:57:17,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:17,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:17,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:17,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:57:17,839 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:17,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash 657307242, now seen corresponding path program 17 times [2024-06-28 01:57:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388985039] [2024-06-28 01:57:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:20,759 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 01:57:20,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388985039] [2024-06-28 01:57:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388985039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143057486] [2024-06-28 01:57:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:20,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:20,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:20,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 313 transitions, 5545 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:20,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:20,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:20,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:23,117 INFO L124 PetriNetUnfolderBase]: 4823/9024 cut-off events. [2024-06-28 01:57:23,117 INFO L125 PetriNetUnfolderBase]: For 66958/66967 co-relation queries the response was YES. [2024-06-28 01:57:23,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35830 conditions, 9024 events. 4823/9024 cut-off events. For 66958/66967 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 73849 event pairs, 3399 based on Foata normal form. 16/9037 useless extension candidates. Maximal degree in co-relation 35733. Up to 8192 conditions per place. [2024-06-28 01:57:23,190 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 237 selfloop transitions, 108 changer transitions 0/350 dead transitions. [2024-06-28 01:57:23,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 350 transitions, 6444 flow [2024-06-28 01:57:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 01:57:23,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-28 01:57:23,191 INFO L175 Difference]: Start difference. First operand has 219 places, 313 transitions, 5545 flow. Second operand 10 states and 157 transitions. [2024-06-28 01:57:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 350 transitions, 6444 flow [2024-06-28 01:57:23,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 350 transitions, 6273 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:23,416 INFO L231 Difference]: Finished difference. Result has 220 places, 313 transitions, 5594 flow [2024-06-28 01:57:23,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5374, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5594, PETRI_PLACES=220, PETRI_TRANSITIONS=313} [2024-06-28 01:57:23,417 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 183 predicate places. [2024-06-28 01:57:23,417 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 313 transitions, 5594 flow [2024-06-28 01:57:23,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:23,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:23,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:23,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:57:23,417 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:23,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2112661112, now seen corresponding path program 18 times [2024-06-28 01:57:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810936732] [2024-06-28 01:57:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:26,308 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 01:57:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810936732] [2024-06-28 01:57:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810936732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:26,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461404121] [2024-06-28 01:57:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:26,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:26,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:26,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 313 transitions, 5594 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:26,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:26,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:26,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:28,718 INFO L124 PetriNetUnfolderBase]: 5057/9437 cut-off events. [2024-06-28 01:57:28,718 INFO L125 PetriNetUnfolderBase]: For 70413/70417 co-relation queries the response was YES. [2024-06-28 01:57:28,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37285 conditions, 9437 events. 5057/9437 cut-off events. For 70413/70417 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 77923 event pairs, 3547 based on Foata normal form. 14/9450 useless extension candidates. Maximal degree in co-relation 37187. Up to 7658 conditions per place. [2024-06-28 01:57:28,789 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 231 selfloop transitions, 117 changer transitions 0/353 dead transitions. [2024-06-28 01:57:28,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 353 transitions, 6570 flow [2024-06-28 01:57:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 01:57:28,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-28 01:57:28,790 INFO L175 Difference]: Start difference. First operand has 220 places, 313 transitions, 5594 flow. Second operand 9 states and 146 transitions. [2024-06-28 01:57:28,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 353 transitions, 6570 flow [2024-06-28 01:57:29,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 353 transitions, 6356 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:29,009 INFO L231 Difference]: Finished difference. Result has 221 places, 317 transitions, 5758 flow [2024-06-28 01:57:29,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5380, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5758, PETRI_PLACES=221, PETRI_TRANSITIONS=317} [2024-06-28 01:57:29,010 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 184 predicate places. [2024-06-28 01:57:29,010 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 317 transitions, 5758 flow [2024-06-28 01:57:29,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:29,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:29,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:29,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:57:29,011 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:29,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -499580314, now seen corresponding path program 19 times [2024-06-28 01:57:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:29,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963047796] [2024-06-28 01:57:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:29,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:31,981 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 01:57:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:31,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963047796] [2024-06-28 01:57:31,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963047796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:31,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500187708] [2024-06-28 01:57:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:31,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:31,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:31,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:31,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 317 transitions, 5758 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:31,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:31,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:31,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:34,280 INFO L124 PetriNetUnfolderBase]: 5234/9759 cut-off events. [2024-06-28 01:57:34,280 INFO L125 PetriNetUnfolderBase]: For 74456/74460 co-relation queries the response was YES. [2024-06-28 01:57:34,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38739 conditions, 9759 events. 5234/9759 cut-off events. For 74456/74460 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 80966 event pairs, 3707 based on Foata normal form. 14/9772 useless extension candidates. Maximal degree in co-relation 38640. Up to 7977 conditions per place. [2024-06-28 01:57:34,362 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 237 selfloop transitions, 117 changer transitions 0/359 dead transitions. [2024-06-28 01:57:34,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 359 transitions, 6760 flow [2024-06-28 01:57:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 01:57:34,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-28 01:57:34,363 INFO L175 Difference]: Start difference. First operand has 221 places, 317 transitions, 5758 flow. Second operand 10 states and 158 transitions. [2024-06-28 01:57:34,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 359 transitions, 6760 flow [2024-06-28 01:57:34,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 359 transitions, 6512 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:34,630 INFO L231 Difference]: Finished difference. Result has 224 places, 321 transitions, 5896 flow [2024-06-28 01:57:34,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5510, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5896, PETRI_PLACES=224, PETRI_TRANSITIONS=321} [2024-06-28 01:57:34,630 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 187 predicate places. [2024-06-28 01:57:34,630 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 321 transitions, 5896 flow [2024-06-28 01:57:34,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:34,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:34,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:34,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:57:34,631 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:34,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2118171362, now seen corresponding path program 20 times [2024-06-28 01:57:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801654484] [2024-06-28 01:57:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:37,947 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 01:57:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801654484] [2024-06-28 01:57:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801654484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:37,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989642781] [2024-06-28 01:57:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:37,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:37,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:37,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 321 transitions, 5896 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:37,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:37,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:37,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:40,428 INFO L124 PetriNetUnfolderBase]: 5224/9732 cut-off events. [2024-06-28 01:57:40,429 INFO L125 PetriNetUnfolderBase]: For 67392/67396 co-relation queries the response was YES. [2024-06-28 01:57:40,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38374 conditions, 9732 events. 5224/9732 cut-off events. For 67392/67396 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 80552 event pairs, 2397 based on Foata normal form. 12/9743 useless extension candidates. Maximal degree in co-relation 38274. Up to 5481 conditions per place. [2024-06-28 01:57:40,522 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 195 selfloop transitions, 171 changer transitions 0/371 dead transitions. [2024-06-28 01:57:40,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 371 transitions, 6980 flow [2024-06-28 01:57:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-28 01:57:40,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:57:40,523 INFO L175 Difference]: Start difference. First operand has 224 places, 321 transitions, 5896 flow. Second operand 10 states and 165 transitions. [2024-06-28 01:57:40,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 371 transitions, 6980 flow [2024-06-28 01:57:40,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 371 transitions, 6722 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:40,810 INFO L231 Difference]: Finished difference. Result has 227 places, 327 transitions, 6255 flow [2024-06-28 01:57:40,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5642, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6255, PETRI_PLACES=227, PETRI_TRANSITIONS=327} [2024-06-28 01:57:40,811 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 190 predicate places. [2024-06-28 01:57:40,811 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 327 transitions, 6255 flow [2024-06-28 01:57:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:57:40,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:40,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:40,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:57:40,812 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:40,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 664672284, now seen corresponding path program 3 times [2024-06-28 01:57:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:40,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575800065] [2024-06-28 01:57:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:44,108 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 01:57:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:44,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575800065] [2024-06-28 01:57:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575800065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012116870] [2024-06-28 01:57:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:44,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:44,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:44,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 327 transitions, 6255 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:44,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:44,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:44,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:46,531 INFO L124 PetriNetUnfolderBase]: 5274/9856 cut-off events. [2024-06-28 01:57:46,531 INFO L125 PetriNetUnfolderBase]: For 71218/71227 co-relation queries the response was YES. [2024-06-28 01:57:46,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39613 conditions, 9856 events. 5274/9856 cut-off events. For 71218/71227 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 82137 event pairs, 3685 based on Foata normal form. 12/9865 useless extension candidates. Maximal degree in co-relation 39511. Up to 8866 conditions per place. [2024-06-28 01:57:46,625 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 260 selfloop transitions, 109 changer transitions 0/374 dead transitions. [2024-06-28 01:57:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 374 transitions, 7263 flow [2024-06-28 01:57:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-28 01:57:46,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-28 01:57:46,627 INFO L175 Difference]: Start difference. First operand has 227 places, 327 transitions, 6255 flow. Second operand 11 states and 176 transitions. [2024-06-28 01:57:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 374 transitions, 7263 flow [2024-06-28 01:57:46,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 374 transitions, 6817 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:46,931 INFO L231 Difference]: Finished difference. Result has 230 places, 327 transitions, 6030 flow [2024-06-28 01:57:46,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5809, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6030, PETRI_PLACES=230, PETRI_TRANSITIONS=327} [2024-06-28 01:57:46,932 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 193 predicate places. [2024-06-28 01:57:46,932 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 327 transitions, 6030 flow [2024-06-28 01:57:46,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:46,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:46,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:57:46,932 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:46,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 923219724, now seen corresponding path program 4 times [2024-06-28 01:57:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276182625] [2024-06-28 01:57:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:50,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 01:57:50,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:50,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276182625] [2024-06-28 01:57:50,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276182625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:50,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:50,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592869536] [2024-06-28 01:57:50,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:50,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:50,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:50,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:50,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 327 transitions, 6030 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:50,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:50,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:50,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:52,556 INFO L124 PetriNetUnfolderBase]: 5340/10019 cut-off events. [2024-06-28 01:57:52,556 INFO L125 PetriNetUnfolderBase]: For 69184/69193 co-relation queries the response was YES. [2024-06-28 01:57:52,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39042 conditions, 10019 events. 5340/10019 cut-off events. For 69184/69193 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 83448 event pairs, 3650 based on Foata normal form. 12/10028 useless extension candidates. Maximal degree in co-relation 38940. Up to 5734 conditions per place. [2024-06-28 01:57:52,656 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 263 selfloop transitions, 110 changer transitions 0/378 dead transitions. [2024-06-28 01:57:52,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 378 transitions, 7079 flow [2024-06-28 01:57:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:57:52,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-28 01:57:52,658 INFO L175 Difference]: Start difference. First operand has 230 places, 327 transitions, 6030 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:57:52,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 378 transitions, 7079 flow [2024-06-28 01:57:52,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 378 transitions, 6835 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-28 01:57:52,929 INFO L231 Difference]: Finished difference. Result has 230 places, 327 transitions, 6015 flow [2024-06-28 01:57:52,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5792, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6015, PETRI_PLACES=230, PETRI_TRANSITIONS=327} [2024-06-28 01:57:52,929 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 193 predicate places. [2024-06-28 01:57:52,929 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 327 transitions, 6015 flow [2024-06-28 01:57:52,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:52,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:52,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:52,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:57:52,930 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:52,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -494002732, now seen corresponding path program 5 times [2024-06-28 01:57:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126201886] [2024-06-28 01:57:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126201886] [2024-06-28 01:57:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126201886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:56,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545450165] [2024-06-28 01:57:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:56,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:56,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 327 transitions, 6015 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:56,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:56,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:58,454 INFO L124 PetriNetUnfolderBase]: 5333/10023 cut-off events. [2024-06-28 01:57:58,455 INFO L125 PetriNetUnfolderBase]: For 62676/62680 co-relation queries the response was YES. [2024-06-28 01:57:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38629 conditions, 10023 events. 5333/10023 cut-off events. For 62676/62680 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 84044 event pairs, 3600 based on Foata normal form. 10/10032 useless extension candidates. Maximal degree in co-relation 38527. Up to 6697 conditions per place. [2024-06-28 01:57:58,536 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 237 selfloop transitions, 126 changer transitions 0/368 dead transitions. [2024-06-28 01:57:58,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 368 transitions, 6879 flow [2024-06-28 01:57:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:57:58,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:57:58,538 INFO L175 Difference]: Start difference. First operand has 230 places, 327 transitions, 6015 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:57:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 368 transitions, 6879 flow [2024-06-28 01:57:58,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 368 transitions, 6284 flow, removed 20 selfloop flow, removed 38 redundant places. [2024-06-28 01:57:58,713 INFO L231 Difference]: Finished difference. Result has 200 places, 327 transitions, 5621 flow [2024-06-28 01:57:58,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5338, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5621, PETRI_PLACES=200, PETRI_TRANSITIONS=327} [2024-06-28 01:57:58,714 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 163 predicate places. [2024-06-28 01:57:58,714 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 327 transitions, 5621 flow [2024-06-28 01:57:58,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:58,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:58,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:58,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:57:58,715 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:58,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1151997124, now seen corresponding path program 1 times [2024-06-28 01:57:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709572731] [2024-06-28 01:57:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:58,809 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 01:57:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709572731] [2024-06-28 01:57:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709572731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:58,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:57:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338737284] [2024-06-28 01:57:58,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:58,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:57:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:58,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:57:58,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:57:58,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:57:58,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 327 transitions, 5621 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 01:57:58,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:58,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:57:58,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:59,853 INFO L124 PetriNetUnfolderBase]: 3083/6584 cut-off events. [2024-06-28 01:57:59,854 INFO L125 PetriNetUnfolderBase]: For 29868/29932 co-relation queries the response was YES. [2024-06-28 01:57:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22920 conditions, 6584 events. 3083/6584 cut-off events. For 29868/29932 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 57229 event pairs, 614 based on Foata normal form. 790/7290 useless extension candidates. Maximal degree in co-relation 22848. Up to 2385 conditions per place. [2024-06-28 01:57:59,898 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 145 selfloop transitions, 92 changer transitions 1/288 dead transitions. [2024-06-28 01:57:59,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 288 transitions, 5373 flow [2024-06-28 01:57:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:57:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:57:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-28 01:57:59,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:57:59,899 INFO L175 Difference]: Start difference. First operand has 200 places, 327 transitions, 5621 flow. Second operand 5 states and 95 transitions. [2024-06-28 01:57:59,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 288 transitions, 5373 flow [2024-06-28 01:57:59,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 288 transitions, 4444 flow, removed 81 selfloop flow, removed 25 redundant places. [2024-06-28 01:57:59,993 INFO L231 Difference]: Finished difference. Result has 181 places, 274 transitions, 4192 flow [2024-06-28 01:57:59,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3911, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4192, PETRI_PLACES=181, PETRI_TRANSITIONS=274} [2024-06-28 01:57:59,994 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 144 predicate places. [2024-06-28 01:57:59,994 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 274 transitions, 4192 flow [2024-06-28 01:57:59,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 01:57:59,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:59,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:57:59,995 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:57:59,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1043979566, now seen corresponding path program 1 times [2024-06-28 01:57:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157701901] [2024-06-28 01:57:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:58:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:58:00,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:58:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:58:00,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:58:00,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:58:00,077 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-28 01:58:00,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-28 01:58:00,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-28 01:58:00,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-28 01:58:00,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-28 01:58:00,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:58:00,081 INFO L445 BasicCegarLoop]: Path program histogram: [20, 6, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:58:00,085 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:58:00,085 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:58:00,154 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,158 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,159 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,160 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,164 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,165 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:58:00,172 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-28 01:58:00,184 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:58:00,188 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:58:00,189 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:58:00 BasicIcfg [2024-06-28 01:58:00,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:58:00,190 INFO L158 Benchmark]: Toolchain (without parser) took 217510.28ms. Allocated memory was 167.8MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 112.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-28 01:58:00,190 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:58:00,190 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:58:00,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.28ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 117.4MB in the end (delta: -5.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-28 01:58:00,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.63ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:58:00,191 INFO L158 Benchmark]: Boogie Preprocessor took 96.34ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:58:00,191 INFO L158 Benchmark]: RCFGBuilder took 1109.19ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 109.9MB in the beginning and 116.6MB in the end (delta: -6.7MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-06-28 01:58:00,191 INFO L158 Benchmark]: TraceAbstraction took 215423.17ms. Allocated memory was 218.1MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 115.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-06-28 01:58:00,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 793.28ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 117.4MB in the end (delta: -5.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.63ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.34ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1109.19ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 109.9MB in the beginning and 116.6MB in the end (delta: -6.7MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * TraceAbstraction took 215423.17ms. Allocated memory was 218.1MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 115.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 y [L816] 0 y [L816] 0 y [L816] 0 y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 y [L816] 0 y [L816] 0 y [L816] 0 y [L817] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 y [L817] 0 y [L817] 0 y [L817] 0 y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 y [L817] 0 y [L817] 0 y [L817] 0 y [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921=-2, t1922=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 215.2s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 79.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2963 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 945 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 762 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15518 IncrementalHoareTripleChecker+Invalid, 16393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 183 mSDtfsCounter, 15518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 62.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6255occurred in iteration=49, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 133.8s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 91930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 01:58:00,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE