./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:54:48,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:54:48,745 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:48,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:54:48,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:54:48,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:54:48,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:54:48,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:54:48,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:54:48,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:54:48,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:54:48,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:54:48,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:54:48,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:54:48,780 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:54:48,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:54:48,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:54:48,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:54:48,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:54:48,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:54:48,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:54:48,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:54:48,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:54:48,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:54:48,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:54:48,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:54:48,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:54:48,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:54:48,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:54:48,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:54:48,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:54:48,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:54:48,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:48,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:54:48,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:54:48,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:54:48,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:54:48,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:54:48,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:54:48,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:54:48,786 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:54:48,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:54:48,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:54:48,787 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:48,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:54:49,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:54:49,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:54:49,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:54:49,040 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:54:49,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 01:54:50,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:54:50,296 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:54:50,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 01:54:50,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee3d520a/9536d5c1108746458884c90e1e3e80e2/FLAG1292cde1a [2024-06-28 01:54:50,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee3d520a/9536d5c1108746458884c90e1e3e80e2 [2024-06-28 01:54:50,337 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:54:50,337 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:54:50,339 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_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 01:54:50,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:54:50,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:54:50,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:50,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:54:50,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:54:50,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:50" (1/2) ... [2024-06-28 01:54:50,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0b8a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:50, skipping insertion in model container [2024-06-28 01:54:50,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:50" (1/2) ... [2024-06-28 01:54:50,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62bf4f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:50, skipping insertion in model container [2024-06-28 01:54:50,519 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:50" (2/2) ... [2024-06-28 01:54:50,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0b8a18 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:50, skipping insertion in model container [2024-06-28 01:54:50,520 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:50" (2/2) ... [2024-06-28 01:54:50,520 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:54:50,595 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:54:50,596 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:50,597 INFO L97 edCorrectnessWitness]: Location invariant before [L815-L815] (((((((((((((((((((((((((((((((! 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:50,597 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:54:50,597 INFO L106 edCorrectnessWitness]: ghost_update [L813-L813] multithreaded = 1; [2024-06-28 01:54:50,654 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:54:50,838 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_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2024-06-28 01:54:50,978 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:50,985 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:54:51,014 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_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:54:51,096 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:51,129 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:54:51,131 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:51 WrapperNode [2024-06-28 01:54:51,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:51,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:51,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:54:51,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:54:51,137 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:51" (1/1) ... [2024-06-28 01:54:51,166 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:51" (1/1) ... [2024-06-28 01:54:51,201 INFO L138 Inliner]: procedures = 174, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2024-06-28 01:54:51,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:51,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:54:51,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:54:51,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:54:51,212 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:51" (1/1) ... [2024-06-28 01:54:51,212 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:51" (1/1) ... [2024-06-28 01:54:51,228 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:51" (1/1) ... [2024-06-28 01:54:51,253 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 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:51,253 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:51" (1/1) ... [2024-06-28 01:54:51,254 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:51" (1/1) ... [2024-06-28 01:54:51,263 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:51" (1/1) ... [2024-06-28 01:54:51,274 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:51" (1/1) ... [2024-06-28 01:54:51,276 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:51" (1/1) ... [2024-06-28 01:54:51,284 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:51" (1/1) ... [2024-06-28 01:54:51,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:54:51,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:54:51,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:54:51,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:54:51,292 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:51" (1/1) ... [2024-06-28 01:54:51,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:54:51,317 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:51,341 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:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:54:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:54:51,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:54:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:54:51,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:54:51,372 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:51,489 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:54:51,491 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:54:51,826 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:54:51,826 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:54:52,115 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:54:52,115 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:54:52,116 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:54:52 BoogieIcfgContainer [2024-06-28 01:54:52,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:54:52,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:54:52,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:54:52,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:54:52,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:54:50" (1/4) ... [2024-06-28 01:54:52,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70293b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:54:52, skipping insertion in model container [2024-06-28 01:54:52,122 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:50" (2/4) ... [2024-06-28 01:54:52,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70293b5d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:52, skipping insertion in model container [2024-06-28 01:54:52,122 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:51" (3/4) ... [2024-06-28 01:54:52,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70293b5d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:52, skipping insertion in model container [2024-06-28 01:54:52,123 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:52" (4/4) ... [2024-06-28 01:54:52,123 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-28 01:54:52,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:54:52,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:54:52,138 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:54:52,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:54:52,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:54:52,233 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 01:54:52,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:52,236 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 39 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:52,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 01:54:52,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-28 01:54:52,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:54:52,261 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;@6a97ae37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:54:52,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:54:52,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:54:52,265 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:54:52,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:52,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:52,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:54:52,266 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:52,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash 545014648, now seen corresponding path program 1 times [2024-06-28 01:54:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:52,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70335216] [2024-06-28 01:54:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:53,696 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,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:53,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70335216] [2024-06-28 01:54:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70335216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:53,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:53,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:54:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300285221] [2024-06-28 01:54:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:53,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:54:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:54:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:54:53,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:54:53,742 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:53,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:53,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:54:53,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:53,948 INFO L124 PetriNetUnfolderBase]: 353/667 cut-off events. [2024-06-28 01:54:53,949 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 01:54:53,950 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 3117 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:53,954 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-28 01:54:53,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 163 flow [2024-06-28 01:54:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:54:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:54:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-28 01:54:53,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-06-28 01:54:53,965 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:53,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 163 flow [2024-06-28 01:54:53,967 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:53,969 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2024-06-28 01:54:53,970 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:53,973 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-28 01:54:53,973 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2024-06-28 01:54:53,973 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:53,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:53,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:54:53,974 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:53,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -226659385, now seen corresponding path program 1 times [2024-06-28 01:54:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281456467] [2024-06-28 01:54:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:55,541 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:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281456467] [2024-06-28 01:54:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281456467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:54:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824334592] [2024-06-28 01:54:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:55,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:54:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:54:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:54:55,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 01:54:55,554 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:55,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:55,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 01:54:55,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:55,864 INFO L124 PetriNetUnfolderBase]: 350/625 cut-off events. [2024-06-28 01:54:55,865 INFO L125 PetriNetUnfolderBase]: For 107/111 co-relation queries the response was YES. [2024-06-28 01:54:55,866 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 2824 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:55,869 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-28 01:54:55,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 256 flow [2024-06-28 01:54:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:54:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:54:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-28 01:54:55,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-28 01:54:55,870 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:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 256 flow [2024-06-28 01:54:55,871 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:55,872 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2024-06-28 01:54:55,872 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:55,873 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-28 01:54:55,873 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2024-06-28 01:54:55,873 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:55,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:55,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:55,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:54:55,874 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:55,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1563495073, now seen corresponding path program 1 times [2024-06-28 01:54:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:55,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904274736] [2024-06-28 01:54:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:57,586 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:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904274736] [2024-06-28 01:54:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904274736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:54:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993886621] [2024-06-28 01:54:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:57,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:54:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:54:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:54:57,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:54:57,594 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:57,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:57,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:54:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:58,075 INFO L124 PetriNetUnfolderBase]: 419/734 cut-off events. [2024-06-28 01:54:58,075 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-06-28 01:54:58,077 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 3336 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:58,081 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-28 01:54:58,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 384 flow [2024-06-28 01:54:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:54:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:54:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-28 01:54:58,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-28 01:54:58,086 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:58,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 384 flow [2024-06-28 01:54:58,089 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:58,090 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 205 flow [2024-06-28 01:54:58,090 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:58,091 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-28 01:54:58,091 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 205 flow [2024-06-28 01:54:58,091 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:58,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:58,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:58,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:54:58,092 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:58,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 999196240, now seen corresponding path program 1 times [2024-06-28 01:54:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:58,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851382112] [2024-06-28 01:54:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:00,057 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:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851382112] [2024-06-28 01:55:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851382112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:55:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393946931] [2024-06-28 01:55:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:00,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:55:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:55:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:55:00,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-28 01:55:00,072 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:55:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-28 01:55:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:00,632 INFO L124 PetriNetUnfolderBase]: 415/726 cut-off events. [2024-06-28 01:55:00,632 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-06-28 01:55:00,634 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 3300 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:55:00,636 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-06-28 01:55:00,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 449 flow [2024-06-28 01:55:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-28 01:55:00,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-28 01:55:00,638 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:55:00,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 449 flow [2024-06-28 01:55:00,640 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:55:00,641 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 219 flow [2024-06-28 01:55:00,641 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:55:00,641 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-28 01:55:00,642 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 219 flow [2024-06-28 01:55:00,642 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:55:00,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:00,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:00,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:55:00,642 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:55:00,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1395657441, now seen corresponding path program 1 times [2024-06-28 01:55:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99590782] [2024-06-28 01:55:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:02,008 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,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99590782] [2024-06-28 01:55:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99590782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:55:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773873590] [2024-06-28 01:55:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:02,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:55:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:55:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:55:02,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:02,022 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:55:02,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:02,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:02,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:02,549 INFO L124 PetriNetUnfolderBase]: 411/766 cut-off events. [2024-06-28 01:55:02,549 INFO L125 PetriNetUnfolderBase]: For 904/904 co-relation queries the response was YES. [2024-06-28 01:55:02,551 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 3610 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:55:02,554 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2024-06-28 01:55:02,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 384 flow [2024-06-28 01:55:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:55:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:55:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-28 01:55:02,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-28 01:55:02,557 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:55:02,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 384 flow [2024-06-28 01:55:02,560 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:55:02,561 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 238 flow [2024-06-28 01:55:02,566 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:55:02,566 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-28 01:55:02,567 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 238 flow [2024-06-28 01:55:02,567 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:55:02,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:02,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:02,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:55:02,567 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:55:02,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1008857798, now seen corresponding path program 1 times [2024-06-28 01:55:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228374993] [2024-06-28 01:55:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:04,783 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:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228374993] [2024-06-28 01:55:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228374993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257174536] [2024-06-28 01:55:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:04,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:04,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:04,806 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:55:04,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:04,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:05,594 INFO L124 PetriNetUnfolderBase]: 426/755 cut-off events. [2024-06-28 01:55:05,594 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2024-06-28 01:55:05,596 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 3509 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:55:05,599 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2024-06-28 01:55:05,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 536 flow [2024-06-28 01:55:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 01:55:05,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:55:05,600 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:55:05,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 536 flow [2024-06-28 01:55:05,603 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:55:05,605 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 281 flow [2024-06-28 01:55:05,605 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:55:05,607 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2024-06-28 01:55:05,607 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 281 flow [2024-06-28 01:55:05,607 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:05,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:05,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:05,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:55:05,608 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:55:05,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1008977768, now seen corresponding path program 2 times [2024-06-28 01:55:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565999280] [2024-06-28 01:55:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:07,655 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:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565999280] [2024-06-28 01:55:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565999280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104501366] [2024-06-28 01:55:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:07,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:07,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:07,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:07,672 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:55:07,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:07,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:07,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:08,438 INFO L124 PetriNetUnfolderBase]: 456/809 cut-off events. [2024-06-28 01:55:08,439 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2024-06-28 01:55:08,440 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 3872 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:55:08,443 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-28 01:55:08,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 567 flow [2024-06-28 01:55:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 01:55:08,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 01:55:08,445 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:55:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 567 flow [2024-06-28 01:55:08,447 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:55:08,448 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 318 flow [2024-06-28 01:55:08,448 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:55:08,448 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-06-28 01:55:08,448 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 318 flow [2024-06-28 01:55:08,449 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:08,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:08,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:55:08,449 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:55:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1374326880, now seen corresponding path program 1 times [2024-06-28 01:55:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523486018] [2024-06-28 01:55:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:10,388 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,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523486018] [2024-06-28 01:55:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523486018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680433839] [2024-06-28 01:55:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:10,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:10,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:10,406 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:55:10,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:10,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:10,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:11,191 INFO L124 PetriNetUnfolderBase]: 520/915 cut-off events. [2024-06-28 01:55:11,192 INFO L125 PetriNetUnfolderBase]: For 1613/1613 co-relation queries the response was YES. [2024-06-28 01:55:11,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 915 events. 520/915 cut-off events. For 1613/1613 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4355 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:55:11,197 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 78 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-28 01:55:11,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 654 flow [2024-06-28 01:55:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 01:55:11,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-28 01:55:11,199 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:55:11,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 654 flow [2024-06-28 01:55:11,202 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:55:11,203 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 373 flow [2024-06-28 01:55:11,203 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:55:11,204 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2024-06-28 01:55:11,204 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 373 flow [2024-06-28 01:55:11,204 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:11,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:11,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:55:11,204 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:55:11,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1786702544, now seen corresponding path program 2 times [2024-06-28 01:55:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10722630] [2024-06-28 01:55:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:13,134 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:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10722630] [2024-06-28 01:55:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10722630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:13,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529929278] [2024-06-28 01:55:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:13,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:13,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:13,153 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:55:13,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:13,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:13,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:13,820 INFO L124 PetriNetUnfolderBase]: 522/922 cut-off events. [2024-06-28 01:55:13,821 INFO L125 PetriNetUnfolderBase]: For 2278/2281 co-relation queries the response was YES. [2024-06-28 01:55:13,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3195 conditions, 922 events. 522/922 cut-off events. For 2278/2281 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4470 event pairs, 93 based on Foata normal form. 4/924 useless extension candidates. Maximal degree in co-relation 3166. Up to 649 conditions per place. [2024-06-28 01:55:13,828 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 67 selfloop transitions, 20 changer transitions 0/92 dead transitions. [2024-06-28 01:55:13,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 667 flow [2024-06-28 01:55:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-28 01:55:13,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 01:55:13,830 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 373 flow. Second operand 6 states and 110 transitions. [2024-06-28 01:55:13,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 667 flow [2024-06-28 01:55:13,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 639 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:13,834 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 442 flow [2024-06-28 01:55:13,834 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=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-28 01:55:13,835 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2024-06-28 01:55:13,835 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 442 flow [2024-06-28 01:55:13,836 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:13,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:13,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:13,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:55:13,836 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:55:13,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1293337924, now seen corresponding path program 3 times [2024-06-28 01:55:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528372725] [2024-06-28 01:55:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:15,675 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:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528372725] [2024-06-28 01:55:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528372725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:15,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:15,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51182421] [2024-06-28 01:55:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:15,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:15,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:15,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 442 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:55:15,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:15,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:16,451 INFO L124 PetriNetUnfolderBase]: 520/918 cut-off events. [2024-06-28 01:55:16,451 INFO L125 PetriNetUnfolderBase]: For 2521/2521 co-relation queries the response was YES. [2024-06-28 01:55:16,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 918 events. 520/918 cut-off events. For 2521/2521 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4430 event pairs, 82 based on Foata normal form. 1/918 useless extension candidates. Maximal degree in co-relation 3434. Up to 728 conditions per place. [2024-06-28 01:55:16,456 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 73 selfloop transitions, 19 changer transitions 0/97 dead transitions. [2024-06-28 01:55:16,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 712 flow [2024-06-28 01:55:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-28 01:55:16,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-28 01:55:16,458 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 442 flow. Second operand 6 states and 115 transitions. [2024-06-28 01:55:16,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 712 flow [2024-06-28 01:55:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 690 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-28 01:55:16,463 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 469 flow [2024-06-28 01:55:16,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-06-28 01:55:16,464 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2024-06-28 01:55:16,464 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 469 flow [2024-06-28 01:55:16,465 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:16,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:16,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:16,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:55:16,465 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:55:16,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1786696034, now seen corresponding path program 3 times [2024-06-28 01:55:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976925787] [2024-06-28 01:55:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:18,311 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:18,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976925787] [2024-06-28 01:55:18,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976925787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:18,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:55:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944454618] [2024-06-28 01:55:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:18,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:55:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:55:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:55:18,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:18,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 469 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:55:18,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:18,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:18,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:18,986 INFO L124 PetriNetUnfolderBase]: 516/912 cut-off events. [2024-06-28 01:55:18,986 INFO L125 PetriNetUnfolderBase]: For 2732/2732 co-relation queries the response was YES. [2024-06-28 01:55:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3528 conditions, 912 events. 516/912 cut-off events. For 2732/2732 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4421 event pairs, 82 based on Foata normal form. 2/913 useless extension candidates. Maximal degree in co-relation 3494. Up to 719 conditions per place. [2024-06-28 01:55:18,991 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 69 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-06-28 01:55:18,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 713 flow [2024-06-28 01:55:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-28 01:55:19,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-28 01:55:19,004 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 469 flow. Second operand 6 states and 111 transitions. [2024-06-28 01:55:19,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 713 flow [2024-06-28 01:55:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 663 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:19,014 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 467 flow [2024-06-28 01:55:19,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=467, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-06-28 01:55:19,016 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2024-06-28 01:55:19,016 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 467 flow [2024-06-28 01:55:19,016 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:19,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:19,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:19,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:55:19,017 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:19,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1293584188, now seen corresponding path program 1 times [2024-06-28 01:55:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560390099] [2024-06-28 01:55:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:20,935 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:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560390099] [2024-06-28 01:55:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560390099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291213523] [2024-06-28 01:55:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:20,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:20,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:20,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 467 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:20,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:20,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:20,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:21,531 INFO L124 PetriNetUnfolderBase]: 513/945 cut-off events. [2024-06-28 01:55:21,531 INFO L125 PetriNetUnfolderBase]: For 2659/2659 co-relation queries the response was YES. [2024-06-28 01:55:21,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 945 events. 513/945 cut-off events. For 2659/2659 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4631 event pairs, 114 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 3514. Up to 785 conditions per place. [2024-06-28 01:55:21,537 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 73 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-06-28 01:55:21,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 703 flow [2024-06-28 01:55:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:55:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:55:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-28 01:55:21,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-28 01:55:21,539 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 467 flow. Second operand 6 states and 103 transitions. [2024-06-28 01:55:21,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 703 flow [2024-06-28 01:55:21,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 663 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:21,544 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 478 flow [2024-06-28 01:55:21,545 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:21,545 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2024-06-28 01:55:21,545 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 478 flow [2024-06-28 01:55:21,545 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:21,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:21,546 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:21,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:55:21,546 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:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 341816536, now seen corresponding path program 1 times [2024-06-28 01:55:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363208156] [2024-06-28 01:55:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:23,884 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:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363208156] [2024-06-28 01:55:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363208156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:23,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:23,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872806914] [2024-06-28 01:55:23,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:23,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:23,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:23,905 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:23,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:23,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:23,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:24,811 INFO L124 PetriNetUnfolderBase]: 577/1041 cut-off events. [2024-06-28 01:55:24,811 INFO L125 PetriNetUnfolderBase]: For 3054/3054 co-relation queries the response was YES. [2024-06-28 01:55:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1041 events. 577/1041 cut-off events. For 3054/3054 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5256 event pairs, 89 based on Foata normal form. 2/1042 useless extension candidates. Maximal degree in co-relation 3843. Up to 645 conditions per place. [2024-06-28 01:55:24,818 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 96 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-28 01:55:24,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 964 flow [2024-06-28 01:55:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-28 01:55:24,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-28 01:55:24,820 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:24,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 964 flow [2024-06-28 01:55:24,825 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:24,827 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 578 flow [2024-06-28 01:55:24,827 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:24,827 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2024-06-28 01:55:24,828 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 578 flow [2024-06-28 01:55:24,828 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:24,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:24,828 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:24,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:55:24,828 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:24,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 345541186, now seen corresponding path program 2 times [2024-06-28 01:55:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113526438] [2024-06-28 01:55:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:26,913 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:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:26,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113526438] [2024-06-28 01:55:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113526438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577140971] [2024-06-28 01:55:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:26,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:26,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:26,924 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:26,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:26,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:26,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:27,864 INFO L124 PetriNetUnfolderBase]: 644/1146 cut-off events. [2024-06-28 01:55:27,864 INFO L125 PetriNetUnfolderBase]: For 4516/4516 co-relation queries the response was YES. [2024-06-28 01:55:27,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1146 events. 644/1146 cut-off events. For 4516/4516 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5824 event pairs, 90 based on Foata normal form. 2/1147 useless extension candidates. Maximal degree in co-relation 4654. Up to 834 conditions per place. [2024-06-28 01:55:27,873 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 111 selfloop transitions, 29 changer transitions 0/145 dead transitions. [2024-06-28 01:55:27,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 145 transitions, 1143 flow [2024-06-28 01:55:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:55:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:55:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-06-28 01:55:27,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2024-06-28 01:55:27,874 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 578 flow. Second operand 11 states and 200 transitions. [2024-06-28 01:55:27,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 145 transitions, 1143 flow [2024-06-28 01:55:27,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 145 transitions, 1067 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:27,886 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 685 flow [2024-06-28 01:55:27,886 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=11, PETRI_FLOW=685, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-06-28 01:55:27,887 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-06-28 01:55:27,887 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 685 flow [2024-06-28 01:55:27,888 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:27,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:27,888 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:27,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:55:27,888 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:27,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash 345535606, now seen corresponding path program 3 times [2024-06-28 01:55:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:27,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826563731] [2024-06-28 01:55:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:30,223 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:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826563731] [2024-06-28 01:55:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826563731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860487329] [2024-06-28 01:55:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:30,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:30,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 685 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:30,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:30,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:30,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:31,256 INFO L124 PetriNetUnfolderBase]: 640/1134 cut-off events. [2024-06-28 01:55:31,257 INFO L125 PetriNetUnfolderBase]: For 4665/4665 co-relation queries the response was YES. [2024-06-28 01:55:31,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 1134 events. 640/1134 cut-off events. For 4665/4665 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5729 event pairs, 89 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 4710. Up to 831 conditions per place. [2024-06-28 01:55:31,267 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 104 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-28 01:55:31,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 1099 flow [2024-06-28 01:55:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 01:55:31,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228571428571429 [2024-06-28 01:55:31,269 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 685 flow. Second operand 10 states and 183 transitions. [2024-06-28 01:55:31,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 1099 flow [2024-06-28 01:55:31,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 138 transitions, 1031 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:31,281 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 681 flow [2024-06-28 01:55:31,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=82, 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=10, PETRI_FLOW=681, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-28 01:55:31,282 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-28 01:55:31,282 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 681 flow [2024-06-28 01:55:31,283 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:31,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:31,283 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:31,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:55:31,284 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:31,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1438771672, now seen corresponding path program 4 times [2024-06-28 01:55:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377386287] [2024-06-28 01:55:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:33,167 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:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377386287] [2024-06-28 01:55:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377386287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:33,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848522768] [2024-06-28 01:55:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:33,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:33,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:33,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 681 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:33,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:33,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:33,945 INFO L124 PetriNetUnfolderBase]: 670/1198 cut-off events. [2024-06-28 01:55:33,945 INFO L125 PetriNetUnfolderBase]: For 5047/5047 co-relation queries the response was YES. [2024-06-28 01:55:33,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 1198 events. 670/1198 cut-off events. For 5047/5047 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6181 event pairs, 88 based on Foata normal form. 2/1199 useless extension candidates. Maximal degree in co-relation 5052. Up to 768 conditions per place. [2024-06-28 01:55:33,952 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 95 selfloop transitions, 39 changer transitions 0/139 dead transitions. [2024-06-28 01:55:33,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 1156 flow [2024-06-28 01:55:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-28 01:55:33,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 01:55:33,953 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 681 flow. Second operand 9 states and 170 transitions. [2024-06-28 01:55:33,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 1156 flow [2024-06-28 01:55:33,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 139 transitions, 1096 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:55:33,968 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 743 flow [2024-06-28 01:55:33,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=621, 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=743, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2024-06-28 01:55:33,969 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-28 01:55:33,969 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 743 flow [2024-06-28 01:55:33,969 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,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:33,969 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:33,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:55:33,970 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:33,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1446128902, now seen corresponding path program 5 times [2024-06-28 01:55:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921580305] [2024-06-28 01:55:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:35,979 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:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921580305] [2024-06-28 01:55:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921580305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:35,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756547247] [2024-06-28 01:55:35,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:35,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:35,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:35,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 743 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:35,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:35,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:35,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:37,065 INFO L124 PetriNetUnfolderBase]: 678/1221 cut-off events. [2024-06-28 01:55:37,065 INFO L125 PetriNetUnfolderBase]: For 5754/5757 co-relation queries the response was YES. [2024-06-28 01:55:37,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5284 conditions, 1221 events. 678/1221 cut-off events. For 5754/5757 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6378 event pairs, 91 based on Foata normal form. 4/1223 useless extension candidates. Maximal degree in co-relation 5240. Up to 652 conditions per place. [2024-06-28 01:55:37,083 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 97 selfloop transitions, 40 changer transitions 0/142 dead transitions. [2024-06-28 01:55:37,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 142 transitions, 1253 flow [2024-06-28 01:55:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-28 01:55:37,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 01:55:37,085 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 743 flow. Second operand 9 states and 168 transitions. [2024-06-28 01:55:37,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 142 transitions, 1253 flow [2024-06-28 01:55:37,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 142 transitions, 1155 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:55:37,096 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 768 flow [2024-06-28 01:55:37,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=768, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2024-06-28 01:55:37,096 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2024-06-28 01:55:37,096 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 768 flow [2024-06-28 01:55:37,097 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,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:37,097 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:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:55:37,097 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:37,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1438777252, now seen corresponding path program 6 times [2024-06-28 01:55:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:37,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089742119] [2024-06-28 01:55:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:39,110 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:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089742119] [2024-06-28 01:55:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089742119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626187568] [2024-06-28 01:55:39,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:39,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:39,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 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:39,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:39,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:39,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:39,936 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-28 01:55:39,936 INFO L125 PetriNetUnfolderBase]: For 5467/5467 co-relation queries the response was YES. [2024-06-28 01:55:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1214 events. 674/1214 cut-off events. For 5467/5467 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6314 event pairs, 94 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 5242. Up to 779 conditions per place. [2024-06-28 01:55:39,943 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 91 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2024-06-28 01:55:39,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 1158 flow [2024-06-28 01:55:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 01:55:39,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:55:39,945 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 768 flow. Second operand 8 states and 152 transitions. [2024-06-28 01:55:39,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 1158 flow [2024-06-28 01:55:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 1092 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:39,958 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 790 flow [2024-06-28 01:55:39,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=702, 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=790, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2024-06-28 01:55:39,958 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-28 01:55:39,959 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 790 flow [2024-06-28 01:55:39,959 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:39,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:39,959 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:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:55:39,959 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:39,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1153072763, now seen corresponding path program 1 times [2024-06-28 01:55:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568045394] [2024-06-28 01:55:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:42,336 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:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568045394] [2024-06-28 01:55:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568045394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815322737] [2024-06-28 01:55:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:42,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:42,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 790 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:42,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:42,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:42,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:43,228 INFO L124 PetriNetUnfolderBase]: 696/1252 cut-off events. [2024-06-28 01:55:43,228 INFO L125 PetriNetUnfolderBase]: For 5838/5838 co-relation queries the response was YES. [2024-06-28 01:55:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5588 conditions, 1252 events. 696/1252 cut-off events. For 5838/5838 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6609 event pairs, 64 based on Foata normal form. 2/1253 useless extension candidates. Maximal degree in co-relation 5542. Up to 853 conditions per place. [2024-06-28 01:55:43,236 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 25 changer transitions 0/139 dead transitions. [2024-06-28 01:55:43,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1264 flow [2024-06-28 01:55:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:55:43,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:55:43,238 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 790 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:55:43,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1264 flow [2024-06-28 01:55:43,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1176 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-28 01:55:43,250 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 764 flow [2024-06-28 01:55:43,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=704, 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=764, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-28 01:55:43,250 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-28 01:55:43,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 764 flow [2024-06-28 01:55:43,251 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:43,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:43,251 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:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:55:43,251 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:43,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2006374787, now seen corresponding path program 2 times [2024-06-28 01:55:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527751160] [2024-06-28 01:55:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:45,315 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:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:45,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527751160] [2024-06-28 01:55:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527751160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:45,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:45,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743872889] [2024-06-28 01:55:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:45,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:45,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:45,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 764 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:45,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:45,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:45,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:46,226 INFO L124 PetriNetUnfolderBase]: 718/1290 cut-off events. [2024-06-28 01:55:46,227 INFO L125 PetriNetUnfolderBase]: For 5605/5605 co-relation queries the response was YES. [2024-06-28 01:55:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 1290 events. 718/1290 cut-off events. For 5605/5605 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6852 event pairs, 108 based on Foata normal form. 2/1291 useless extension candidates. Maximal degree in co-relation 5572. Up to 996 conditions per place. [2024-06-28 01:55:46,234 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 24 changer transitions 0/138 dead transitions. [2024-06-28 01:55:46,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 138 transitions, 1202 flow [2024-06-28 01:55:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 01:55:46,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-28 01:55:46,249 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 764 flow. Second operand 8 states and 149 transitions. [2024-06-28 01:55:46,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 138 transitions, 1202 flow [2024-06-28 01:55:46,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 138 transitions, 1154 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:46,261 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 778 flow [2024-06-28 01:55:46,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=719, 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=778, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2024-06-28 01:55:46,261 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2024-06-28 01:55:46,262 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 778 flow [2024-06-28 01:55:46,262 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:46,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:46,263 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:46,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:55:46,263 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:46,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1590074905, now seen corresponding path program 3 times [2024-06-28 01:55:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366563812] [2024-06-28 01:55:46,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:46,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:48,558 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:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366563812] [2024-06-28 01:55:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366563812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:48,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:48,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302291771] [2024-06-28 01:55:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:48,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:48,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:48,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 778 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:48,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:48,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:49,302 INFO L124 PetriNetUnfolderBase]: 740/1330 cut-off events. [2024-06-28 01:55:49,302 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2024-06-28 01:55:49,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5755 conditions, 1330 events. 740/1330 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7112 event pairs, 107 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 5708. Up to 1085 conditions per place. [2024-06-28 01:55:49,328 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 110 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-28 01:55:49,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 1179 flow [2024-06-28 01:55:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:55:49,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:55:49,346 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 778 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:55:49,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 1179 flow [2024-06-28 01:55:49,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1117 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:49,358 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 768 flow [2024-06-28 01:55:49,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=716, 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=768, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-06-28 01:55:49,359 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-06-28 01:55:49,359 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 768 flow [2024-06-28 01:55:49,359 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:49,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:49,359 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:49,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:55:49,360 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:49,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2121850655, now seen corresponding path program 1 times [2024-06-28 01:55:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966018758] [2024-06-28 01:55:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:51,878 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,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:51,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966018758] [2024-06-28 01:55:51,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966018758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:51,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:51,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202659835] [2024-06-28 01:55:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:51,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:51,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:51,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 768 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,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:51,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:51,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:52,789 INFO L124 PetriNetUnfolderBase]: 762/1348 cut-off events. [2024-06-28 01:55:52,789 INFO L125 PetriNetUnfolderBase]: For 6309/6309 co-relation queries the response was YES. [2024-06-28 01:55:52,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 1348 events. 762/1348 cut-off events. For 6309/6309 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7109 event pairs, 93 based on Foata normal form. 2/1349 useless extension candidates. Maximal degree in co-relation 5714. Up to 1087 conditions per place. [2024-06-28 01:55:52,815 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 116 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-28 01:55:52,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1202 flow [2024-06-28 01:55:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 01:55:52,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-28 01:55:52,827 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 768 flow. Second operand 9 states and 163 transitions. [2024-06-28 01:55:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1202 flow [2024-06-28 01:55:52,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1165 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:52,842 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 808 flow [2024-06-28 01:55:52,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=731, 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=808, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-28 01:55:52,842 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:52,843 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 808 flow [2024-06-28 01:55:52,844 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,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:52,844 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,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:55:52,844 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:52,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1652245635, now seen corresponding path program 4 times [2024-06-28 01:55:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115050309] [2024-06-28 01:55:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:55,207 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,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115050309] [2024-06-28 01:55:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115050309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770655409] [2024-06-28 01:55:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:55,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:55,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:55,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 808 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:55,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:55,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:55,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:56,200 INFO L124 PetriNetUnfolderBase]: 759/1365 cut-off events. [2024-06-28 01:55:56,201 INFO L125 PetriNetUnfolderBase]: For 6615/6615 co-relation queries the response was YES. [2024-06-28 01:55:56,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 1365 events. 759/1365 cut-off events. For 6615/6615 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7314 event pairs, 65 based on Foata normal form. 2/1366 useless extension candidates. Maximal degree in co-relation 5792. Up to 1004 conditions per place. [2024-06-28 01:55:56,235 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 105 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-06-28 01:55:56,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 134 transitions, 1206 flow [2024-06-28 01:55:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-28 01:55:56,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-06-28 01:55:56,237 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 808 flow. Second operand 7 states and 132 transitions. [2024-06-28 01:55:56,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 134 transitions, 1206 flow [2024-06-28 01:55:56,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1145 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:56,261 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 804 flow [2024-06-28 01:55:56,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=747, 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=804, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-28 01:55:56,262 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:56,262 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 804 flow [2024-06-28 01:55:56,262 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:56,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:56,262 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:56,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:55:56,262 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:56,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1786041017, now seen corresponding path program 2 times [2024-06-28 01:55:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367838025] [2024-06-28 01:55:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:58,936 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,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367838025] [2024-06-28 01:55:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367838025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894443685] [2024-06-28 01:55:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:58,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:58,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:55:58,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 804 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,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:58,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:55:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:59,577 INFO L124 PetriNetUnfolderBase]: 781/1383 cut-off events. [2024-06-28 01:55:59,577 INFO L125 PetriNetUnfolderBase]: For 7295/7295 co-relation queries the response was YES. [2024-06-28 01:55:59,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 1383 events. 781/1383 cut-off events. For 7295/7295 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7385 event pairs, 94 based on Foata normal form. 2/1384 useless extension candidates. Maximal degree in co-relation 5960. Up to 1092 conditions per place. [2024-06-28 01:55:59,585 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 103 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-28 01:55:59,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1176 flow [2024-06-28 01:55:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 01:55:59,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 01:55:59,587 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 804 flow. Second operand 7 states and 128 transitions. [2024-06-28 01:55:59,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1176 flow [2024-06-28 01:55:59,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1118 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:59,601 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 832 flow [2024-06-28 01:55:59,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=746, 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=832, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-28 01:55:59,602 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-28 01:55:59,602 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 832 flow [2024-06-28 01:55:59,603 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,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:59,603 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:59,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:55:59,604 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:59,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:59,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1880331483, now seen corresponding path program 3 times [2024-06-28 01:55:59,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:59,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882814946] [2024-06-28 01:55:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:02,107 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,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882814946] [2024-06-28 01:56:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882814946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81238858] [2024-06-28 01:56:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:02,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:02,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:02,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 832 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,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:02,974 INFO L124 PetriNetUnfolderBase]: 803/1442 cut-off events. [2024-06-28 01:56:02,975 INFO L125 PetriNetUnfolderBase]: For 7628/7631 co-relation queries the response was YES. [2024-06-28 01:56:02,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6208 conditions, 1442 events. 803/1442 cut-off events. For 7628/7631 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7873 event pairs, 98 based on Foata normal form. 4/1444 useless extension candidates. Maximal degree in co-relation 6159. Up to 1080 conditions per place. [2024-06-28 01:56:02,981 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 105 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-28 01:56:02,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1224 flow [2024-06-28 01:56:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-28 01:56:02,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 01:56:02,982 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 832 flow. Second operand 7 states and 126 transitions. [2024-06-28 01:56:02,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1224 flow [2024-06-28 01:56:02,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 1150 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:02,998 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 822 flow [2024-06-28 01:56:02,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=766, 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=822, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2024-06-28 01:56:02,998 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2024-06-28 01:56:02,998 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 822 flow [2024-06-28 01:56:02,999 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:02,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:02,999 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:56:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:56:02,999 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:56:02,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1888902363, now seen corresponding path program 4 times [2024-06-28 01:56:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977016785] [2024-06-28 01:56:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:05,155 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977016785] [2024-06-28 01:56:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977016785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:56:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28298433] [2024-06-28 01:56:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:05,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:56:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:56:05,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:56:05,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:05,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 822 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:05,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:05,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:05,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:05,817 INFO L124 PetriNetUnfolderBase]: 804/1449 cut-off events. [2024-06-28 01:56:05,817 INFO L125 PetriNetUnfolderBase]: For 6782/6785 co-relation queries the response was YES. [2024-06-28 01:56:05,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6133 conditions, 1449 events. 804/1449 cut-off events. For 6782/6785 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7874 event pairs, 99 based on Foata normal form. 4/1451 useless extension candidates. Maximal degree in co-relation 6083. Up to 949 conditions per place. [2024-06-28 01:56:05,826 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 103 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-06-28 01:56:05,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 133 transitions, 1232 flow [2024-06-28 01:56:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:56:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:56:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-28 01:56:05,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-28 01:56:05,845 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 822 flow. Second operand 7 states and 124 transitions. [2024-06-28 01:56:05,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 133 transitions, 1232 flow [2024-06-28 01:56:05,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1188 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:05,864 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 843 flow [2024-06-28 01:56:05,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=778, 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=843, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-28 01:56:05,864 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2024-06-28 01:56:05,864 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 843 flow [2024-06-28 01:56:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:05,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:05,865 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:56:05,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:56:05,865 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:56:05,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2017490688, now seen corresponding path program 1 times [2024-06-28 01:56:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:05,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996772443] [2024-06-28 01:56:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:05,933 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,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996772443] [2024-06-28 01:56:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996772443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:05,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:56:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437507870] [2024-06-28 01:56:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:05,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:56:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:05,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:56:05,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:56:05,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:56:05,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 843 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:56:05,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:05,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:56:05,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:06,086 INFO L124 PetriNetUnfolderBase]: 435/865 cut-off events. [2024-06-28 01:56:06,087 INFO L125 PetriNetUnfolderBase]: For 4802/4838 co-relation queries the response was YES. [2024-06-28 01:56:06,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 865 events. 435/865 cut-off events. For 4802/4838 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4649 event pairs, 87 based on Foata normal form. 66/897 useless extension candidates. Maximal degree in co-relation 3338. Up to 327 conditions per place. [2024-06-28 01:56:06,091 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 52 selfloop transitions, 22 changer transitions 1/96 dead transitions. [2024-06-28 01:56:06,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 901 flow [2024-06-28 01:56:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:56:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:56:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-28 01:56:06,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-28 01:56:06,092 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 843 flow. Second operand 4 states and 86 transitions. [2024-06-28 01:56:06,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 901 flow [2024-06-28 01:56:06,101 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:56:06,103 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 629 flow [2024-06-28 01:56:06,103 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:56:06,103 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-06-28 01:56:06,103 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 629 flow [2024-06-28 01:56:06,103 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:56:06,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:06,104 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,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:56:06,104 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:56:06,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1237050241, now seen corresponding path program 1 times [2024-06-28 01:56:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980523172] [2024-06-28 01:56:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:08,111 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,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980523172] [2024-06-28 01:56:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980523172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:08,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:08,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730985863] [2024-06-28 01:56:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:08,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:08,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:08,154 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:56:08,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:08,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:08,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:09,311 INFO L124 PetriNetUnfolderBase]: 843/1591 cut-off events. [2024-06-28 01:56:09,311 INFO L125 PetriNetUnfolderBase]: For 9062/9064 co-relation queries the response was YES. [2024-06-28 01:56:09,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 1591 events. 843/1591 cut-off events. For 9062/9064 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8808 event pairs, 240 based on Foata normal form. 10/1600 useless extension candidates. Maximal degree in co-relation 6117. Up to 755 conditions per place. [2024-06-28 01:56:09,320 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 109 selfloop transitions, 76 changer transitions 0/190 dead transitions. [2024-06-28 01:56:09,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 190 transitions, 1783 flow [2024-06-28 01:56:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2024-06-28 01:56:09,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2024-06-28 01:56:09,322 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:56:09,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 190 transitions, 1783 flow [2024-06-28 01:56:09,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:56:09,339 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 1230 flow [2024-06-28 01:56:09,339 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:56:09,344 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-28 01:56:09,344 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 1230 flow [2024-06-28 01:56:09,345 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:09,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:09,345 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:09,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:56:09,345 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:56:09,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:09,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1385515593, now seen corresponding path program 2 times [2024-06-28 01:56:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141778227] [2024-06-28 01:56:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:12,188 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,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141778227] [2024-06-28 01:56:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141778227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:12,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:12,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257379410] [2024-06-28 01:56:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:12,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:12,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:12,227 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:12,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:12,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:12,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:13,165 INFO L124 PetriNetUnfolderBase]: 994/1866 cut-off events. [2024-06-28 01:56:13,166 INFO L125 PetriNetUnfolderBase]: For 11815/11817 co-relation queries the response was YES. [2024-06-28 01:56:13,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 1866 events. 994/1866 cut-off events. For 11815/11817 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10750 event pairs, 270 based on Foata normal form. 10/1875 useless extension candidates. Maximal degree in co-relation 7372. Up to 647 conditions per place. [2024-06-28 01:56:13,176 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 99 selfloop transitions, 83 changer transitions 0/187 dead transitions. [2024-06-28 01:56:13,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 1890 flow [2024-06-28 01:56:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-28 01:56:13,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-28 01:56:13,178 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 1230 flow. Second operand 11 states and 182 transitions. [2024-06-28 01:56:13,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 1890 flow [2024-06-28 01:56:13,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 1838 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:13,200 INFO L231 Difference]: Finished difference. Result has 121 places, 133 transitions, 1466 flow [2024-06-28 01:56:13,201 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=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1466, PETRI_PLACES=121, PETRI_TRANSITIONS=133} [2024-06-28 01:56:13,201 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2024-06-28 01:56:13,201 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 133 transitions, 1466 flow [2024-06-28 01:56:13,202 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,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:13,202 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,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:56:13,202 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:13,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2138548287, now seen corresponding path program 3 times [2024-06-28 01:56:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987233915] [2024-06-28 01:56:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:15,561 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,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987233915] [2024-06-28 01:56:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987233915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:15,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653162846] [2024-06-28 01:56:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:15,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:15,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:15,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 133 transitions, 1466 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,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:15,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:15,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:16,598 INFO L124 PetriNetUnfolderBase]: 1284/2387 cut-off events. [2024-06-28 01:56:16,599 INFO L125 PetriNetUnfolderBase]: For 18582/18587 co-relation queries the response was YES. [2024-06-28 01:56:16,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9770 conditions, 2387 events. 1284/2387 cut-off events. For 18582/18587 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14653 event pairs, 508 based on Foata normal form. 10/2394 useless extension candidates. Maximal degree in co-relation 9718. Up to 1583 conditions per place. [2024-06-28 01:56:16,608 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 110 selfloop transitions, 92 changer transitions 0/207 dead transitions. [2024-06-28 01:56:16,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 207 transitions, 2478 flow [2024-06-28 01:56:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2024-06-28 01:56:16,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43736263736263736 [2024-06-28 01:56:16,610 INFO L175 Difference]: Start difference. First operand has 121 places, 133 transitions, 1466 flow. Second operand 13 states and 199 transitions. [2024-06-28 01:56:16,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 207 transitions, 2478 flow [2024-06-28 01:56:16,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 207 transitions, 2317 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:16,640 INFO L231 Difference]: Finished difference. Result has 136 places, 164 transitions, 2073 flow [2024-06-28 01:56:16,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2073, PETRI_PLACES=136, PETRI_TRANSITIONS=164} [2024-06-28 01:56:16,641 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 99 predicate places. [2024-06-28 01:56:16,641 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 164 transitions, 2073 flow [2024-06-28 01:56:16,641 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,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:16,641 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,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:56:16,642 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:16,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1861554469, now seen corresponding path program 4 times [2024-06-28 01:56:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604171336] [2024-06-28 01:56:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:18,257 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,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604171336] [2024-06-28 01:56:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604171336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296429964] [2024-06-28 01:56:18,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:18,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:18,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:18,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 164 transitions, 2073 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:18,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:18,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:18,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:19,614 INFO L124 PetriNetUnfolderBase]: 1497/2797 cut-off events. [2024-06-28 01:56:19,614 INFO L125 PetriNetUnfolderBase]: For 21742/21744 co-relation queries the response was YES. [2024-06-28 01:56:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11686 conditions, 2797 events. 1497/2797 cut-off events. For 21742/21744 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17845 event pairs, 711 based on Foata normal form. 12/2808 useless extension candidates. Maximal degree in co-relation 11624. Up to 1998 conditions per place. [2024-06-28 01:56:19,628 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 104 selfloop transitions, 124 changer transitions 0/233 dead transitions. [2024-06-28 01:56:19,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 233 transitions, 3049 flow [2024-06-28 01:56:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2024-06-28 01:56:19,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432967032967033 [2024-06-28 01:56:19,629 INFO L175 Difference]: Start difference. First operand has 136 places, 164 transitions, 2073 flow. Second operand 13 states and 197 transitions. [2024-06-28 01:56:19,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 233 transitions, 3049 flow [2024-06-28 01:56:19,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 233 transitions, 2997 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 01:56:19,671 INFO L231 Difference]: Finished difference. Result has 150 places, 190 transitions, 2721 flow [2024-06-28 01:56:19,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2721, PETRI_PLACES=150, PETRI_TRANSITIONS=190} [2024-06-28 01:56:19,672 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 113 predicate places. [2024-06-28 01:56:19,672 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 190 transitions, 2721 flow [2024-06-28 01:56:19,672 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:19,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:19,672 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:19,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:56:19,673 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:19,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 575522311, now seen corresponding path program 5 times [2024-06-28 01:56:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163258948] [2024-06-28 01:56:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:21,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:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163258948] [2024-06-28 01:56:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163258948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736279139] [2024-06-28 01:56:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:21,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:21,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:21,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 190 transitions, 2721 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:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:21,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:21,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:22,701 INFO L124 PetriNetUnfolderBase]: 1661/3089 cut-off events. [2024-06-28 01:56:22,701 INFO L125 PetriNetUnfolderBase]: For 24885/24887 co-relation queries the response was YES. [2024-06-28 01:56:22,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13371 conditions, 3089 events. 1661/3089 cut-off events. For 24885/24887 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20205 event pairs, 712 based on Foata normal form. 10/3098 useless extension candidates. Maximal degree in co-relation 13303. Up to 2059 conditions per place. [2024-06-28 01:56:22,722 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 109 selfloop transitions, 132 changer transitions 0/246 dead transitions. [2024-06-28 01:56:22,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 246 transitions, 3507 flow [2024-06-28 01:56:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 215 transitions. [2024-06-28 01:56:22,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-28 01:56:22,725 INFO L175 Difference]: Start difference. First operand has 150 places, 190 transitions, 2721 flow. Second operand 14 states and 215 transitions. [2024-06-28 01:56:22,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 246 transitions, 3507 flow [2024-06-28 01:56:22,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 246 transitions, 3392 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:22,784 INFO L231 Difference]: Finished difference. Result has 160 places, 198 transitions, 3019 flow [2024-06-28 01:56:22,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3019, PETRI_PLACES=160, PETRI_TRANSITIONS=198} [2024-06-28 01:56:22,785 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 123 predicate places. [2024-06-28 01:56:22,785 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 198 transitions, 3019 flow [2024-06-28 01:56:22,785 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:22,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:22,786 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:22,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:56:22,786 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:22,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1607585065, now seen corresponding path program 6 times [2024-06-28 01:56:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797295749] [2024-06-28 01:56:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:24,598 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:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797295749] [2024-06-28 01:56:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797295749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24640336] [2024-06-28 01:56:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:24,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:24,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:24,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 198 transitions, 3019 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:24,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:24,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:24,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:26,184 INFO L124 PetriNetUnfolderBase]: 1824/3402 cut-off events. [2024-06-28 01:56:26,185 INFO L125 PetriNetUnfolderBase]: For 32087/32089 co-relation queries the response was YES. [2024-06-28 01:56:26,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15004 conditions, 3402 events. 1824/3402 cut-off events. For 32087/32089 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22801 event pairs, 830 based on Foata normal form. 10/3411 useless extension candidates. Maximal degree in co-relation 14934. Up to 2277 conditions per place. [2024-06-28 01:56:26,209 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 124 selfloop transitions, 126 changer transitions 0/255 dead transitions. [2024-06-28 01:56:26,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 255 transitions, 3854 flow [2024-06-28 01:56:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2024-06-28 01:56:26,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45102040816326533 [2024-06-28 01:56:26,211 INFO L175 Difference]: Start difference. First operand has 160 places, 198 transitions, 3019 flow. Second operand 14 states and 221 transitions. [2024-06-28 01:56:26,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 255 transitions, 3854 flow [2024-06-28 01:56:26,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 255 transitions, 3642 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-28 01:56:26,278 INFO L231 Difference]: Finished difference. Result has 166 places, 204 transitions, 3198 flow [2024-06-28 01:56:26,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3198, PETRI_PLACES=166, PETRI_TRANSITIONS=204} [2024-06-28 01:56:26,278 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 129 predicate places. [2024-06-28 01:56:26,279 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 204 transitions, 3198 flow [2024-06-28 01:56:26,279 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:26,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:26,279 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:26,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:56:26,279 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:26,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1607732935, now seen corresponding path program 7 times [2024-06-28 01:56:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036669894] [2024-06-28 01:56:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:27,928 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,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036669894] [2024-06-28 01:56:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036669894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:27,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234465662] [2024-06-28 01:56:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:27,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:27,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 204 transitions, 3198 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,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:27,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:27,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:29,426 INFO L124 PetriNetUnfolderBase]: 1843/3488 cut-off events. [2024-06-28 01:56:29,427 INFO L125 PetriNetUnfolderBase]: For 31243/31245 co-relation queries the response was YES. [2024-06-28 01:56:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15167 conditions, 3488 events. 1843/3488 cut-off events. For 31243/31245 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23727 event pairs, 994 based on Foata normal form. 12/3499 useless extension candidates. Maximal degree in co-relation 15093. Up to 2597 conditions per place. [2024-06-28 01:56:29,452 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 120 changer transitions 0/247 dead transitions. [2024-06-28 01:56:29,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 247 transitions, 3890 flow [2024-06-28 01:56:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2024-06-28 01:56:29,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44175824175824174 [2024-06-28 01:56:29,454 INFO L175 Difference]: Start difference. First operand has 166 places, 204 transitions, 3198 flow. Second operand 13 states and 201 transitions. [2024-06-28 01:56:29,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 247 transitions, 3890 flow [2024-06-28 01:56:29,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 247 transitions, 3588 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:29,528 INFO L231 Difference]: Finished difference. Result has 168 places, 204 transitions, 3161 flow [2024-06-28 01:56:29,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2911, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3161, PETRI_PLACES=168, PETRI_TRANSITIONS=204} [2024-06-28 01:56:29,529 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 131 predicate places. [2024-06-28 01:56:29,529 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 204 transitions, 3161 flow [2024-06-28 01:56:29,529 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,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:29,530 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,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:56:29,530 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:29,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 783918151, now seen corresponding path program 8 times [2024-06-28 01:56:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507282225] [2024-06-28 01:56:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:31,465 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,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507282225] [2024-06-28 01:56:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507282225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:31,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:31,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:31,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848522563] [2024-06-28 01:56:31,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:31,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:31,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:31,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 204 transitions, 3161 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,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:31,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:31,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:32,916 INFO L124 PetriNetUnfolderBase]: 1945/3698 cut-off events. [2024-06-28 01:56:32,917 INFO L125 PetriNetUnfolderBase]: For 32729/32731 co-relation queries the response was YES. [2024-06-28 01:56:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15865 conditions, 3698 events. 1945/3698 cut-off events. For 32729/32731 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 25602 event pairs, 1157 based on Foata normal form. 12/3709 useless extension candidates. Maximal degree in co-relation 15790. Up to 3161 conditions per place. [2024-06-28 01:56:32,948 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 194 selfloop transitions, 56 changer transitions 0/255 dead transitions. [2024-06-28 01:56:32,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 255 transitions, 4052 flow [2024-06-28 01:56:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2024-06-28 01:56:32,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42637362637362636 [2024-06-28 01:56:32,952 INFO L175 Difference]: Start difference. First operand has 168 places, 204 transitions, 3161 flow. Second operand 13 states and 194 transitions. [2024-06-28 01:56:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 255 transitions, 4052 flow [2024-06-28 01:56:33,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 255 transitions, 3800 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:33,029 INFO L231 Difference]: Finished difference. Result has 173 places, 215 transitions, 3294 flow [2024-06-28 01:56:33,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3294, PETRI_PLACES=173, PETRI_TRANSITIONS=215} [2024-06-28 01:56:33,030 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 136 predicate places. [2024-06-28 01:56:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 215 transitions, 3294 flow [2024-06-28 01:56:33,030 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,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:33,031 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,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:56:33,031 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:33,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 892154289, now seen corresponding path program 9 times [2024-06-28 01:56:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629953792] [2024-06-28 01:56:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:34,964 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:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629953792] [2024-06-28 01:56:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629953792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719893673] [2024-06-28 01:56:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:34,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:34,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 215 transitions, 3294 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:34,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:34,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:34,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:36,492 INFO L124 PetriNetUnfolderBase]: 2030/3877 cut-off events. [2024-06-28 01:56:36,493 INFO L125 PetriNetUnfolderBase]: For 33213/33217 co-relation queries the response was YES. [2024-06-28 01:56:36,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16325 conditions, 3877 events. 2030/3877 cut-off events. For 33213/33217 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 27185 event pairs, 1229 based on Foata normal form. 14/3890 useless extension candidates. Maximal degree in co-relation 16246. Up to 3320 conditions per place. [2024-06-28 01:56:36,524 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 195 selfloop transitions, 56 changer transitions 0/256 dead transitions. [2024-06-28 01:56:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 256 transitions, 3972 flow [2024-06-28 01:56:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 205 transitions. [2024-06-28 01:56:36,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-28 01:56:36,526 INFO L175 Difference]: Start difference. First operand has 173 places, 215 transitions, 3294 flow. Second operand 14 states and 205 transitions. [2024-06-28 01:56:36,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 256 transitions, 3972 flow [2024-06-28 01:56:36,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 256 transitions, 3859 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:36,617 INFO L231 Difference]: Finished difference. Result has 182 places, 215 transitions, 3301 flow [2024-06-28 01:56:36,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3181, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3301, PETRI_PLACES=182, PETRI_TRANSITIONS=215} [2024-06-28 01:56:36,618 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 145 predicate places. [2024-06-28 01:56:36,618 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 215 transitions, 3301 flow [2024-06-28 01:56:36,618 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:36,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:36,619 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:36,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:56:36,619 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:36,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1711078313, now seen corresponding path program 10 times [2024-06-28 01:56:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:36,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688991543] [2024-06-28 01:56:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:38,537 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:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688991543] [2024-06-28 01:56:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688991543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401896076] [2024-06-28 01:56:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:38,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:38,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:38,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:38,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 215 transitions, 3301 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:38,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:38,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:38,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:40,075 INFO L124 PetriNetUnfolderBase]: 2084/3995 cut-off events. [2024-06-28 01:56:40,075 INFO L125 PetriNetUnfolderBase]: For 31519/31523 co-relation queries the response was YES. [2024-06-28 01:56:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 3995 events. 2084/3995 cut-off events. For 31519/31523 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28303 event pairs, 1198 based on Foata normal form. 12/4006 useless extension candidates. Maximal degree in co-relation 16384. Up to 3156 conditions per place. [2024-06-28 01:56:40,098 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 203 selfloop transitions, 55 changer transitions 0/263 dead transitions. [2024-06-28 01:56:40,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 263 transitions, 4042 flow [2024-06-28 01:56:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 01:56:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 01:56:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2024-06-28 01:56:40,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2024-06-28 01:56:40,100 INFO L175 Difference]: Start difference. First operand has 182 places, 215 transitions, 3301 flow. Second operand 13 states and 200 transitions. [2024-06-28 01:56:40,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 263 transitions, 4042 flow [2024-06-28 01:56:40,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 263 transitions, 3924 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:40,181 INFO L231 Difference]: Finished difference. Result has 185 places, 217 transitions, 3350 flow [2024-06-28 01:56:40,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3191, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3350, PETRI_PLACES=185, PETRI_TRANSITIONS=217} [2024-06-28 01:56:40,181 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 148 predicate places. [2024-06-28 01:56:40,181 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 217 transitions, 3350 flow [2024-06-28 01:56:40,182 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:40,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:40,182 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:40,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:56:40,182 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:40,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1705352861, now seen corresponding path program 1 times [2024-06-28 01:56:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:40,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960980052] [2024-06-28 01:56:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:42,816 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:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960980052] [2024-06-28 01:56:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960980052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:42,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682413542] [2024-06-28 01:56:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:42,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:42,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:42,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:42,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 217 transitions, 3350 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:42,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:42,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:44,308 INFO L124 PetriNetUnfolderBase]: 2144/4115 cut-off events. [2024-06-28 01:56:44,308 INFO L125 PetriNetUnfolderBase]: For 32201/32205 co-relation queries the response was YES. [2024-06-28 01:56:44,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16886 conditions, 4115 events. 2144/4115 cut-off events. For 32201/32205 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29389 event pairs, 1256 based on Foata normal form. 10/4124 useless extension candidates. Maximal degree in co-relation 16806. Up to 3329 conditions per place. [2024-06-28 01:56:44,336 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 200 selfloop transitions, 60 changer transitions 0/265 dead transitions. [2024-06-28 01:56:44,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 265 transitions, 4092 flow [2024-06-28 01:56:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-28 01:56:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-28 01:56:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-06-28 01:56:44,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42653061224489797 [2024-06-28 01:56:44,338 INFO L175 Difference]: Start difference. First operand has 185 places, 217 transitions, 3350 flow. Second operand 14 states and 209 transitions. [2024-06-28 01:56:44,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 265 transitions, 4092 flow [2024-06-28 01:56:44,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 265 transitions, 3981 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-28 01:56:44,424 INFO L231 Difference]: Finished difference. Result has 190 places, 221 transitions, 3437 flow [2024-06-28 01:56:44,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3248, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3437, PETRI_PLACES=190, PETRI_TRANSITIONS=221} [2024-06-28 01:56:44,424 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 153 predicate places. [2024-06-28 01:56:44,424 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 221 transitions, 3437 flow [2024-06-28 01:56:44,425 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:44,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:44,425 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:44,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:56:44,425 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:44,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1296801963, now seen corresponding path program 11 times [2024-06-28 01:56:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9626230] [2024-06-28 01:56:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:47,017 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:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9626230] [2024-06-28 01:56:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9626230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406441493] [2024-06-28 01:56:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:47,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:47,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 221 transitions, 3437 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:47,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:47,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:48,256 INFO L124 PetriNetUnfolderBase]: 2131/4094 cut-off events. [2024-06-28 01:56:48,257 INFO L125 PetriNetUnfolderBase]: For 30556/30560 co-relation queries the response was YES. [2024-06-28 01:56:48,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16590 conditions, 4094 events. 2131/4094 cut-off events. For 30556/30560 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 29151 event pairs, 1163 based on Foata normal form. 14/4107 useless extension candidates. Maximal degree in co-relation 16508. Up to 2865 conditions per place. [2024-06-28 01:56:48,292 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 122 selfloop transitions, 139 changer transitions 0/266 dead transitions. [2024-06-28 01:56:48,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 266 transitions, 4230 flow [2024-06-28 01:56:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-28 01:56:48,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-28 01:56:48,294 INFO L175 Difference]: Start difference. First operand has 190 places, 221 transitions, 3437 flow. Second operand 11 states and 170 transitions. [2024-06-28 01:56:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 266 transitions, 4230 flow [2024-06-28 01:56:48,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 266 transitions, 4101 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-28 01:56:48,380 INFO L231 Difference]: Finished difference. Result has 190 places, 227 transitions, 3716 flow [2024-06-28 01:56:48,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3716, PETRI_PLACES=190, PETRI_TRANSITIONS=227} [2024-06-28 01:56:48,380 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 153 predicate places. [2024-06-28 01:56:48,381 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 227 transitions, 3716 flow [2024-06-28 01:56:48,381 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,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:48,381 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,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:56:48,381 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:48,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2079558619, now seen corresponding path program 12 times [2024-06-28 01:56:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472831446] [2024-06-28 01:56:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:50,972 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:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472831446] [2024-06-28 01:56:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472831446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462591676] [2024-06-28 01:56:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:50,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:50,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:50,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 227 transitions, 3716 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:50,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:50,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:50,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:52,408 INFO L124 PetriNetUnfolderBase]: 2261/4322 cut-off events. [2024-06-28 01:56:52,408 INFO L125 PetriNetUnfolderBase]: For 33523/33527 co-relation queries the response was YES. [2024-06-28 01:56:52,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17627 conditions, 4322 events. 2261/4322 cut-off events. For 33523/33527 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31039 event pairs, 1366 based on Foata normal form. 14/4335 useless extension candidates. Maximal degree in co-relation 17544. Up to 3521 conditions per place. [2024-06-28 01:56:52,436 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 190 selfloop transitions, 75 changer transitions 0/270 dead transitions. [2024-06-28 01:56:52,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 270 transitions, 4480 flow [2024-06-28 01:56:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:56:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:56:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 178 transitions. [2024-06-28 01:56:52,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-28 01:56:52,438 INFO L175 Difference]: Start difference. First operand has 190 places, 227 transitions, 3716 flow. Second operand 12 states and 178 transitions. [2024-06-28 01:56:52,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 270 transitions, 4480 flow [2024-06-28 01:56:52,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 270 transitions, 4222 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:52,527 INFO L231 Difference]: Finished difference. Result has 193 places, 230 transitions, 3682 flow [2024-06-28 01:56:52,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3682, PETRI_PLACES=193, PETRI_TRANSITIONS=230} [2024-06-28 01:56:52,528 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 156 predicate places. [2024-06-28 01:56:52,528 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 230 transitions, 3682 flow [2024-06-28 01:56:52,528 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:52,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:52,529 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:52,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:56:52,529 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:52,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2017742989, now seen corresponding path program 13 times [2024-06-28 01:56:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698537826] [2024-06-28 01:56:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:54,754 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:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698537826] [2024-06-28 01:56:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698537826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:54,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113231343] [2024-06-28 01:56:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:54,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:54,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:54,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 230 transitions, 3682 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:54,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:54,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:54,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:56,182 INFO L124 PetriNetUnfolderBase]: 2391/4552 cut-off events. [2024-06-28 01:56:56,182 INFO L125 PetriNetUnfolderBase]: For 35567/35571 co-relation queries the response was YES. [2024-06-28 01:56:56,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18429 conditions, 4552 events. 2391/4552 cut-off events. For 35567/35571 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 33039 event pairs, 1453 based on Foata normal form. 14/4565 useless extension candidates. Maximal degree in co-relation 18345. Up to 3751 conditions per place. [2024-06-28 01:56:56,215 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 191 selfloop transitions, 75 changer transitions 0/271 dead transitions. [2024-06-28 01:56:56,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 271 transitions, 4437 flow [2024-06-28 01:56:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-28 01:56:56,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2024-06-28 01:56:56,217 INFO L175 Difference]: Start difference. First operand has 193 places, 230 transitions, 3682 flow. Second operand 11 states and 167 transitions. [2024-06-28 01:56:56,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 271 transitions, 4437 flow [2024-06-28 01:56:56,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 271 transitions, 4284 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-28 01:56:56,326 INFO L231 Difference]: Finished difference. Result has 194 places, 232 transitions, 3742 flow [2024-06-28 01:56:56,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3529, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3742, PETRI_PLACES=194, PETRI_TRANSITIONS=232} [2024-06-28 01:56:56,327 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 157 predicate places. [2024-06-28 01:56:56,327 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 232 transitions, 3742 flow [2024-06-28 01:56:56,328 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:56,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:56,328 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:56,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:56:56,328 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:56,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2074048369, now seen corresponding path program 14 times [2024-06-28 01:56:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767626066] [2024-06-28 01:56:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:58,954 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:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767626066] [2024-06-28 01:56:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767626066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:58,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:56:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978018378] [2024-06-28 01:56:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:56:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:56:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:56:58,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:56:58,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 232 transitions, 3742 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:58,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:58,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:56:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:00,479 INFO L124 PetriNetUnfolderBase]: 2491/4732 cut-off events. [2024-06-28 01:57:00,480 INFO L125 PetriNetUnfolderBase]: For 36814/36818 co-relation queries the response was YES. [2024-06-28 01:57:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 4732 events. 2491/4732 cut-off events. For 36814/36818 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 34640 event pairs, 1358 based on Foata normal form. 12/4743 useless extension candidates. Maximal degree in co-relation 19011. Up to 3215 conditions per place. [2024-06-28 01:57:00,524 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 197 selfloop transitions, 79 changer transitions 0/281 dead transitions. [2024-06-28 01:57:00,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 281 transitions, 4591 flow [2024-06-28 01:57:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-28 01:57:00,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44935064935064933 [2024-06-28 01:57:00,526 INFO L175 Difference]: Start difference. First operand has 194 places, 232 transitions, 3742 flow. Second operand 11 states and 173 transitions. [2024-06-28 01:57:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 281 transitions, 4591 flow [2024-06-28 01:57:00,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 281 transitions, 4432 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:00,660 INFO L231 Difference]: Finished difference. Result has 197 places, 237 transitions, 3896 flow [2024-06-28 01:57:00,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3583, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3896, PETRI_PLACES=197, PETRI_TRANSITIONS=237} [2024-06-28 01:57:00,661 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 160 predicate places. [2024-06-28 01:57:00,661 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 237 transitions, 3896 flow [2024-06-28 01:57:00,661 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:00,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:00,661 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:00,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:57:00,661 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:57:00,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2012165407, now seen corresponding path program 2 times [2024-06-28 01:57:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423463973] [2024-06-28 01:57:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:03,618 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:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423463973] [2024-06-28 01:57:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423463973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447479001] [2024-06-28 01:57:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:03,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:03,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:03,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 237 transitions, 3896 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:03,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:03,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:03,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:05,214 INFO L124 PetriNetUnfolderBase]: 2533/4826 cut-off events. [2024-06-28 01:57:05,215 INFO L125 PetriNetUnfolderBase]: For 38077/38081 co-relation queries the response was YES. [2024-06-28 01:57:05,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19552 conditions, 4826 events. 2533/4826 cut-off events. For 38077/38081 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 35533 event pairs, 1464 based on Foata normal form. 10/4835 useless extension candidates. Maximal degree in co-relation 19465. Up to 3433 conditions per place. [2024-06-28 01:57:05,255 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 193 selfloop transitions, 84 changer transitions 0/282 dead transitions. [2024-06-28 01:57:05,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 282 transitions, 4663 flow [2024-06-28 01:57:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:57:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:57:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2024-06-28 01:57:05,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-28 01:57:05,261 INFO L175 Difference]: Start difference. First operand has 197 places, 237 transitions, 3896 flow. Second operand 12 states and 183 transitions. [2024-06-28 01:57:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 282 transitions, 4663 flow [2024-06-28 01:57:05,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 282 transitions, 4529 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:05,399 INFO L231 Difference]: Finished difference. Result has 202 places, 238 transitions, 3956 flow [2024-06-28 01:57:05,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3762, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3956, PETRI_PLACES=202, PETRI_TRANSITIONS=238} [2024-06-28 01:57:05,400 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 165 predicate places. [2024-06-28 01:57:05,400 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 238 transitions, 3956 flow [2024-06-28 01:57:05,401 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:05,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:05,401 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:05,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:57:05,401 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:05,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -314480925, now seen corresponding path program 15 times [2024-06-28 01:57:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727365233] [2024-06-28 01:57:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:07,687 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:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727365233] [2024-06-28 01:57:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727365233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274948163] [2024-06-28 01:57:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:07,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:07,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:07,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 238 transitions, 3956 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:07,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:07,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:07,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:09,199 INFO L124 PetriNetUnfolderBase]: 2663/5050 cut-off events. [2024-06-28 01:57:09,199 INFO L125 PetriNetUnfolderBase]: For 42003/42007 co-relation queries the response was YES. [2024-06-28 01:57:09,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20468 conditions, 5050 events. 2663/5050 cut-off events. For 42003/42007 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 37459 event pairs, 1556 based on Foata normal form. 14/5063 useless extension candidates. Maximal degree in co-relation 20379. Up to 3950 conditions per place. [2024-06-28 01:57:09,240 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 165 selfloop transitions, 106 changer transitions 0/276 dead transitions. [2024-06-28 01:57:09,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 276 transitions, 4714 flow [2024-06-28 01:57:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-28 01:57:09,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-28 01:57:09,243 INFO L175 Difference]: Start difference. First operand has 202 places, 238 transitions, 3956 flow. Second operand 9 states and 146 transitions. [2024-06-28 01:57:09,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 276 transitions, 4714 flow [2024-06-28 01:57:09,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 276 transitions, 4530 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-28 01:57:09,379 INFO L231 Difference]: Finished difference. Result has 201 places, 240 transitions, 4063 flow [2024-06-28 01:57:09,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3772, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4063, PETRI_PLACES=201, PETRI_TRANSITIONS=240} [2024-06-28 01:57:09,380 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 164 predicate places. [2024-06-28 01:57:09,380 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 240 transitions, 4063 flow [2024-06-28 01:57:09,383 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:09,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:09,383 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:09,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:57:09,384 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:09,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -275044401, now seen corresponding path program 16 times [2024-06-28 01:57:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064753084] [2024-06-28 01:57:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:09,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:11,764 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:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064753084] [2024-06-28 01:57:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064753084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727971356] [2024-06-28 01:57:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:11,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:11,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 240 transitions, 4063 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:11,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:11,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:11,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:13,288 INFO L124 PetriNetUnfolderBase]: 2760/5217 cut-off events. [2024-06-28 01:57:13,289 INFO L125 PetriNetUnfolderBase]: For 42732/42736 co-relation queries the response was YES. [2024-06-28 01:57:13,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21100 conditions, 5217 events. 2760/5217 cut-off events. For 42732/42736 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 38844 event pairs, 1627 based on Foata normal form. 14/5230 useless extension candidates. Maximal degree in co-relation 21010. Up to 4125 conditions per place. [2024-06-28 01:57:13,341 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 169 selfloop transitions, 106 changer transitions 0/280 dead transitions. [2024-06-28 01:57:13,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 4837 flow [2024-06-28 01:57:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 01:57:13,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-28 01:57:13,350 INFO L175 Difference]: Start difference. First operand has 201 places, 240 transitions, 4063 flow. Second operand 10 states and 158 transitions. [2024-06-28 01:57:13,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 4837 flow [2024-06-28 01:57:13,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 280 transitions, 4626 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:13,531 INFO L231 Difference]: Finished difference. Result has 204 places, 242 transitions, 4147 flow [2024-06-28 01:57:13,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3852, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4147, PETRI_PLACES=204, PETRI_TRANSITIONS=242} [2024-06-28 01:57:13,532 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 167 predicate places. [2024-06-28 01:57:13,532 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 242 transitions, 4147 flow [2024-06-28 01:57:13,532 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:13,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:13,532 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:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:57:13,533 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:13,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -120541515, now seen corresponding path program 17 times [2024-06-28 01:57:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969297243] [2024-06-28 01:57:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:15,958 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,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969297243] [2024-06-28 01:57:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969297243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540451081] [2024-06-28 01:57:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:15,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:15,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:15,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:15,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 242 transitions, 4147 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:15,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:15,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,564 INFO L124 PetriNetUnfolderBase]: 2812/5350 cut-off events. [2024-06-28 01:57:17,564 INFO L125 PetriNetUnfolderBase]: For 41839/41848 co-relation queries the response was YES. [2024-06-28 01:57:17,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21355 conditions, 5350 events. 2812/5350 cut-off events. For 41839/41848 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 40201 event pairs, 1669 based on Foata normal form. 16/5363 useless extension candidates. Maximal degree in co-relation 21264. Up to 4603 conditions per place. [2024-06-28 01:57:17,615 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 170 selfloop transitions, 104 changer transitions 0/279 dead transitions. [2024-06-28 01:57:17,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 279 transitions, 4874 flow [2024-06-28 01:57:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 01:57:17,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-28 01:57:17,617 INFO L175 Difference]: Start difference. First operand has 204 places, 242 transitions, 4147 flow. Second operand 10 states and 157 transitions. [2024-06-28 01:57:17,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 279 transitions, 4874 flow [2024-06-28 01:57:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 279 transitions, 4659 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:17,781 INFO L231 Difference]: Finished difference. Result has 206 places, 242 transitions, 4144 flow [2024-06-28 01:57:17,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3932, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4144, PETRI_PLACES=206, PETRI_TRANSITIONS=242} [2024-06-28 01:57:17,782 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 169 predicate places. [2024-06-28 01:57:17,782 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 242 transitions, 4144 flow [2024-06-28 01:57:17,782 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:17,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:17,782 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,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:57:17,782 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:17,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash 461579375, now seen corresponding path program 18 times [2024-06-28 01:57:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605887779] [2024-06-28 01:57:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:20,223 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,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605887779] [2024-06-28 01:57:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605887779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51826763] [2024-06-28 01:57:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:20,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:20,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:20,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 242 transitions, 4144 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,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:20,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:20,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:22,097 INFO L124 PetriNetUnfolderBase]: 2802/5325 cut-off events. [2024-06-28 01:57:22,097 INFO L125 PetriNetUnfolderBase]: For 34443/34447 co-relation queries the response was YES. [2024-06-28 01:57:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20907 conditions, 5325 events. 2802/5325 cut-off events. For 34443/34447 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 39857 event pairs, 1226 based on Foata normal form. 12/5336 useless extension candidates. Maximal degree in co-relation 20815. Up to 2985 conditions per place. [2024-06-28 01:57:22,170 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 159 selfloop transitions, 125 changer transitions 0/289 dead transitions. [2024-06-28 01:57:22,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 289 transitions, 4991 flow [2024-06-28 01:57:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-28 01:57:22,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 01:57:22,172 INFO L175 Difference]: Start difference. First operand has 206 places, 242 transitions, 4144 flow. Second operand 10 states and 165 transitions. [2024-06-28 01:57:22,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 289 transitions, 4991 flow [2024-06-28 01:57:22,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 289 transitions, 4777 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:22,367 INFO L231 Difference]: Finished difference. Result has 209 places, 246 transitions, 4360 flow [2024-06-28 01:57:22,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3934, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4360, PETRI_PLACES=209, PETRI_TRANSITIONS=246} [2024-06-28 01:57:22,368 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 172 predicate places. [2024-06-28 01:57:22,368 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 246 transitions, 4360 flow [2024-06-28 01:57:22,368 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:22,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:22,369 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:22,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:57:22,369 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:22,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1582764155, now seen corresponding path program 3 times [2024-06-28 01:57:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528871017] [2024-06-28 01:57:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:24,945 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:24,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:24,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528871017] [2024-06-28 01:57:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528871017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276210934] [2024-06-28 01:57:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:24,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:24,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:24,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 246 transitions, 4360 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:24,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:24,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:24,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:26,700 INFO L124 PetriNetUnfolderBase]: 2852/5446 cut-off events. [2024-06-28 01:57:26,700 INFO L125 PetriNetUnfolderBase]: For 36831/36840 co-relation queries the response was YES. [2024-06-28 01:57:26,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21694 conditions, 5446 events. 2852/5446 cut-off events. For 36831/36840 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 41266 event pairs, 1659 based on Foata normal form. 12/5455 useless extension candidates. Maximal degree in co-relation 21600. Up to 4544 conditions per place. [2024-06-28 01:57:26,755 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 183 selfloop transitions, 105 changer transitions 0/293 dead transitions. [2024-06-28 01:57:26,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 293 transitions, 5166 flow [2024-06-28 01:57:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-28 01:57:26,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-28 01:57:26,756 INFO L175 Difference]: Start difference. First operand has 209 places, 246 transitions, 4360 flow. Second operand 11 states and 176 transitions. [2024-06-28 01:57:26,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 293 transitions, 5166 flow [2024-06-28 01:57:26,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 293 transitions, 4859 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-28 01:57:26,914 INFO L231 Difference]: Finished difference. Result has 212 places, 246 transitions, 4266 flow [2024-06-28 01:57:26,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4053, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4266, PETRI_PLACES=212, PETRI_TRANSITIONS=246} [2024-06-28 01:57:26,915 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 175 predicate places. [2024-06-28 01:57:26,915 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 246 transitions, 4266 flow [2024-06-28 01:57:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:26,915 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:26,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:57:26,915 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:26,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1573567385, now seen corresponding path program 4 times [2024-06-28 01:57:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997874628] [2024-06-28 01:57:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:29,538 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:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997874628] [2024-06-28 01:57:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997874628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:29,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:57:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023545035] [2024-06-28 01:57:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:29,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:57:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:29,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:57:29,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:57:29,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:29,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 246 transitions, 4266 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:29,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:29,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:31,088 INFO L124 PetriNetUnfolderBase]: 2918/5612 cut-off events. [2024-06-28 01:57:31,089 INFO L125 PetriNetUnfolderBase]: For 33842/33851 co-relation queries the response was YES. [2024-06-28 01:57:31,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21935 conditions, 5612 events. 2918/5612 cut-off events. For 33842/33851 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42750 event pairs, 1675 based on Foata normal form. 12/5621 useless extension candidates. Maximal degree in co-relation 21840. Up to 2750 conditions per place. [2024-06-28 01:57:31,138 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 184 selfloop transitions, 106 changer transitions 0/295 dead transitions. [2024-06-28 01:57:31,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 295 transitions, 5081 flow [2024-06-28 01:57:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:57:31,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-28 01:57:31,139 INFO L175 Difference]: Start difference. First operand has 212 places, 246 transitions, 4266 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:57:31,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 295 transitions, 5081 flow [2024-06-28 01:57:31,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 295 transitions, 4862 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:31,285 INFO L231 Difference]: Finished difference. Result has 213 places, 246 transitions, 4266 flow [2024-06-28 01:57:31,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4051, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4266, PETRI_PLACES=213, PETRI_TRANSITIONS=246} [2024-06-28 01:57:31,286 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 176 predicate places. [2024-06-28 01:57:31,286 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 246 transitions, 4266 flow [2024-06-28 01:57:31,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:31,286 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:31,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:57:31,287 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:31,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash -314265723, now seen corresponding path program 5 times [2024-06-28 01:57:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:31,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795533483] [2024-06-28 01:57:31,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:31,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:33,708 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:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795533483] [2024-06-28 01:57:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795533483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026178377] [2024-06-28 01:57:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:33,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:33,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 01:57:33,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 246 transitions, 4266 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:33,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:33,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 01:57:33,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:35,164 INFO L124 PetriNetUnfolderBase]: 2911/5619 cut-off events. [2024-06-28 01:57:35,164 INFO L125 PetriNetUnfolderBase]: For 29709/29713 co-relation queries the response was YES. [2024-06-28 01:57:35,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 5619 events. 2911/5619 cut-off events. For 29709/29713 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 43189 event pairs, 1643 based on Foata normal form. 10/5628 useless extension candidates. Maximal degree in co-relation 21582. Up to 3525 conditions per place. [2024-06-28 01:57:35,222 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 167 selfloop transitions, 114 changer transitions 0/286 dead transitions. [2024-06-28 01:57:35,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 286 transitions, 4942 flow [2024-06-28 01:57:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:57:35,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:57:35,224 INFO L175 Difference]: Start difference. First operand has 213 places, 246 transitions, 4266 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:57:35,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 286 transitions, 4942 flow [2024-06-28 01:57:35,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 286 transitions, 4430 flow, removed 8 selfloop flow, removed 35 redundant places. [2024-06-28 01:57:35,316 INFO L231 Difference]: Finished difference. Result has 186 places, 246 transitions, 3930 flow [2024-06-28 01:57:35,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3930, PETRI_PLACES=186, PETRI_TRANSITIONS=246} [2024-06-28 01:57:35,317 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 149 predicate places. [2024-06-28 01:57:35,317 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 246 transitions, 3930 flow [2024-06-28 01:57:35,317 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:35,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:35,318 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:35,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:57:35,318 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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:35,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:35,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1490429032, now seen corresponding path program 1 times [2024-06-28 01:57:35,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700195353] [2024-06-28 01:57:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:35,402 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:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700195353] [2024-06-28 01:57:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700195353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:57:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794961096] [2024-06-28 01:57:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:35,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:57:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:57:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:57:35,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-28 01:57:35,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 246 transitions, 3930 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:35,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:35,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-28 01:57:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:35,932 INFO L124 PetriNetUnfolderBase]: 1805/3774 cut-off events. [2024-06-28 01:57:35,933 INFO L125 PetriNetUnfolderBase]: For 16119/16155 co-relation queries the response was YES. [2024-06-28 01:57:35,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13999 conditions, 3774 events. 1805/3774 cut-off events. For 16119/16155 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28644 event pairs, 252 based on Foata normal form. 341/4048 useless extension candidates. Maximal degree in co-relation 13930. Up to 1254 conditions per place. [2024-06-28 01:57:35,959 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 105 selfloop transitions, 90 changer transitions 1/235 dead transitions. [2024-06-28 01:57:35,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 235 transitions, 4071 flow [2024-06-28 01:57:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:57:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:57:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-28 01:57:35,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 01:57:35,961 INFO L175 Difference]: Start difference. First operand has 186 places, 246 transitions, 3930 flow. Second operand 5 states and 95 transitions. [2024-06-28 01:57:35,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 235 transitions, 4071 flow [2024-06-28 01:57:36,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 235 transitions, 3290 flow, removed 46 selfloop flow, removed 24 redundant places. [2024-06-28 01:57:36,017 INFO L231 Difference]: Finished difference. Result has 168 places, 222 transitions, 3128 flow [2024-06-28 01:57:36,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2853, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3128, PETRI_PLACES=168, PETRI_TRANSITIONS=222} [2024-06-28 01:57:36,017 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 131 predicate places. [2024-06-28 01:57:36,018 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 222 transitions, 3128 flow [2024-06-28 01:57:36,018 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:36,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:36,018 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:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:57:36,018 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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:36,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 753124110, now seen corresponding path program 1 times [2024-06-28 01:57:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061782234] [2024-06-28 01:57:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:57:36,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:57:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:57:36,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:57:36,116 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:57:36,117 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-28 01:57:36,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-28 01:57:36,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-28 01:57:36,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-28 01:57:36,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-28 01:57:36,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:57:36,123 INFO L445 BasicCegarLoop]: Path program histogram: [18, 6, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:36,129 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:57:36,129 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:57:36,183 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,183 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,188 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,188 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,188 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,190 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,190 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,191 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:36,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-28 01:57:36,230 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:57:36,230 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:57:36,231 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:57:36 BasicIcfg [2024-06-28 01:57:36,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:57:36,232 INFO L158 Benchmark]: Toolchain (without parser) took 165720.32ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 88.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 340.7MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,232 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 135.5MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:57:36,232 INFO L158 Benchmark]: Witness Parser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:57:36,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.61ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 111.9MB in the end (delta: -23.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.04ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,233 INFO L158 Benchmark]: Boogie Preprocessor took 86.96ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 105.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,233 INFO L158 Benchmark]: RCFGBuilder took 826.07ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 105.6MB in the beginning and 119.2MB in the end (delta: -13.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,233 INFO L158 Benchmark]: TraceAbstraction took 164112.95ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 119.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 326.4MB. Max. memory is 16.1GB. [2024-06-28 01:57:36,234 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.15ms. Allocated memory is still 167.8MB. Free memory was 135.5MB in the beginning and 135.5MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.61ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 111.9MB in the end (delta: -23.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.04ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.96ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 105.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 826.07ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 105.6MB in the beginning and 119.2MB in the end (delta: -13.5MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * TraceAbstraction took 164112.95ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 119.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 326.4MB. 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; [L812] 0 pthread_t t1929; [L813] 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, t1929=-1, 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}] [L813] FCALL, FORK 0 pthread_create(&t1929, ((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, t1929=-1, 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] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 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=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] 0 pthread_t t1930; 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, t1929=-1, 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}] [L772] 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=0, 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}] [L815] 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))); [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 y [L815] 0 y [L815] 0 y [L815] 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, t1929=-1, weak$$choice0=0, weak$$choice1=0, 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}] [L815] FCALL, FORK 0 pthread_create(&t1930, ((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, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, 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}] [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 y [L815] 0 y [L815] 0 y [L815] 0 y [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}, \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, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, 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}] [L777] 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=0, 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}] [L784] 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=0, 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}] [L787] 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=0, 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}] [L790] 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) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] 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) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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=0, 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}] [L797] 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=0, 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 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, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, 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}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, 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}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 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, t1929=-1, t1930=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}] [L832] 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: 815]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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: 163.9s, OverallIterations: 52, TraceHistogramMax: 1, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 57.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2777 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 968 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 799 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15271 IncrementalHoareTripleChecker+Invalid, 16070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 799 mSolverCounterUnsat, 197 mSDtfsCounter, 15271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 546 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 50.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4360occurred in iteration=47, InterpolantAutomatonStates: 467, 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.5s SatisfiabilityAnalysisTime, 105.0s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 735 ConstructedInterpolants, 0 QuantifiedInterpolants, 85426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 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:57:36,279 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